The following pages link to Domination-balanced graphs (Q3950587):
Displaying 50 items.
- On the roots of domination polynomial of graphs (Q266947) (← links)
- Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates (Q293628) (← links)
- Quasiperfect domination in trees (Q324884) (← links)
- Location-domination in line graphs (Q329538) (← links)
- On the outer-connected domination in graphs (Q358644) (← links)
- Rainbow edge-coloring and rainbow domination (Q383777) (← links)
- Multiple factor Nordhaus-Gaddum type results for domination and total domination (Q423926) (← links)
- Fair domination in graphs (Q449132) (← links)
- On Cartesian products having a minimum dominating set that is a box or a stairway (Q497315) (← links)
- On average lower independence and domination numbers in graphs (Q556830) (← links)
- Dominator colorings in some classes of graphs (Q659760) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Characterization of graphs using domination polynomials (Q709243) (← links)
- A sharp upper bound on the least signless Laplacian eigenvalue using domination number (Q742633) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Minimizing the Laplacian eigenvalues for trees with given domination number (Q865427) (← links)
- On the domination number of the Cartesian product of the cycle of length \(n\) and any graph (Q869572) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- A sharp upper bound on algebraic connectivity using domination number (Q967504) (← links)
- On the profile of the corona of two graphs (Q1029099) (← links)
- The product of the independent domination numbers of a graph and its complement (Q1179268) (← links)
- Graphs with large restrained domination number (Q1292850) (← links)
- The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) (Q1569066) (← links)
- Characterization of graphs with equal domination and covering number (Q1584421) (← links)
- Graphs having distance-\(n\) domination number half their order (Q1613368) (← links)
- A lower bound for the algebraic connectivity of a graph in terms of the domination number (Q1617025) (← links)
- Upper bound on 3-rainbow domination in graphs with minimum degree 2 (Q1662645) (← links)
- On upper bounds for the independent transversal domination number (Q1693131) (← links)
- On the global Roman domination number in graphs (Q1708687) (← links)
- On the co-Roman domination in graphs (Q1717198) (← links)
- Distribution centers in graphs (Q1752461) (← links)
- A note on connected bipartite graphs having independent domination number half their order. (Q1767156) (← links)
- A Nordhaus-Gaddum-type result for the induced path number (Q1928519) (← links)
- Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement (Q1941298) (← links)
- The least \(Q\)-eigenvalue with fixed domination number (Q2007551) (← links)
- On the domination number of graphs with minimum degree six (Q2032873) (← links)
- A continuous generalization of domination-like invariants (Q2045030) (← links)
- Super domination in trees (Q2071243) (← links)
- Isolation of \(k\)-cliques. II (Q2138948) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity (Q2217482) (← links)
- The compared costs of domination location-domination and identification (Q2282469) (← links)
- Graphs with equal domination and covering numbers (Q2292127) (← links)
- Three-arc graphs: characterization and domination (Q2355755) (← links)
- Vertex-addition strategy for domination-like invariants (Q2401431) (← links)
- On 2-step and hop dominating sets in graphs (Q2409527) (← links)
- Nordhaus-Gaddum bounds for total domination (Q2430063) (← links)
- Extremal graphs for a new upper bound on domination parameters in graphs (Q2433699) (← links)
- On domination and reinforcement numbers in trees (Q2469996) (← links)
- Profile minimization on compositions of graphs (Q2471064) (← links)