Academic Journal
A note on independent domination in almost-regular graphs.
| Τίτλος: | A note on independent domination in almost-regular graphs. |
|---|---|
| Συγγραφείς: | Goddard, Wayne1,2 goddard@clemson.edu, Henning, Michael A.2 mahenning@uj.ac.za |
| Πηγή: | Communications in Combinatorics & Optimization. Dec2026, Vol. 11 Issue 4, p1175-1180. 6p. |
| Θεματικοί όροι: | *Regular graphs, *Dominating set, *Bipartite graphs, *Graph theory |
| Περίληψη: | A classic result in domination theory is that a regular graph has in- dependent domination number at most half the order. We strengthen this result to \almost-regular" graphs by showing that if a graph has minimum degree d > 0 and maximum degree at most d + 3, and the subgraph induced by the vertices of degree d +3 (if any) is bipartite, then the independent domination number is at most half the order. We also discuss related questions. [ABSTRACT FROM AUTHOR] |
| Βάση Δεδομένων: | Academic Search Index |
καταχωρήστε σχόλιο πρώτοι!