Domination-balanced graphs
From MaRDI portal
Publication:3950587
DOI10.1002/JGT.3190060104zbMATH Open0489.05049DBLPjournals/jgt/PayanX82OpenAlexW2140273161WikidataQ29039199 ScholiaQ29039199MaRDI QIDQ3950587FDOQ3950587
Authors: Charles Payan, Nguyen Huy Xuong 
Publication date: 1982
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190060104
Cited In (87)
- On the outer-connected domination in graphs
- On the roots of domination polynomial of graphs
- On the edge geodetic and edge geodetic domination numbers of a graph
- A bound on the \(k\)-domination number of a graph.
- Fair domination in graphs
- Graphs having distance-\(n\) domination number half their order
- Minimizing the Laplacian eigenvalues for trees with given domination number
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Characterization of graphs using domination polynomials
- Proof of a conjecture on game domination
- On average lower independence and domination numbers in graphs
- The least \(Q\)-eigenvalue with fixed domination number
- Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
- Multiple factor Nordhaus-Gaddum type results for domination and total domination
- On the global Roman domination number in graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Profile minimization on compositions of graphs
- Distribution centers in graphs
- Bounds and extremal graphs for total dominating identifying codes
- Further results on the least \(Q\)-eigenvalue of a graph with fixed domination number
- Nordhaus-Gaddum results for the induced path number of a graph when neither the graph nor its complement contains isolates
- On the domination number of a graph and its total graph
- Graphs with equal domination and covering numbers
- A note on connected bipartite graphs having independent domination number half their order.
- The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
- Title not available (Why is that?)
- Graphs with large restrained domination number
- On the domination number of a graph and its shadow graph
- Bounds on the outer-independent double Italian domination number
- On upper bounds for the independent transversal domination number
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- A sharp upper bound on the least signless Laplacian eigenvalue using domination number
- Title not available (Why is that?)
- Quasiperfect domination in trees
- Location-domination in line graphs
- A sharp upper bound on algebraic connectivity using domination number
- A Nordhaus-Gaddum-type result for the induced path number
- On domination and reinforcement numbers in trees
- Locating-dominating sets in twin-free graphs
- Bounds on domination parameters in graphs: a brief survey
- Characterization of graphs with equal domination and covering number
- Extremal graphs for a new upper bound on domination parameters in graphs
- The product of the independent domination numbers of a graph and its complement
- On the domination number of the Cartesian product of the cycle of length \(n\) and any graph
- Nordhaus-Gaddum results for the sum of the induced path number of a graph and its complement
- A continuous generalization of domination-like invariants
- On well-dominated graphs
- Nordhaus-Gaddum bounds for total domination
- Relations between the Roman \(k\)-domination and Roman domination numbers in graphs
- On the domination number of graphs with minimum degree six
- On Cartesian products having a minimum dominating set that is a box or a stairway
- Super domination in trees
- Dominator colorings in some classes of graphs
- Upper bound on 3-rainbow domination in graphs with minimum degree 2
- Rainbow edge-coloring and rainbow domination
- Three-arc graphs: characterization and domination
- Graphs with large total domination number
- Domatically perfect graphs
- Domination in planar graphs with small diameter*
- Multiple domination
- On the profile of the corona of two graphs
- On the co-Roman domination in graphs
- Domination number of the non-commuting graph of finite groups
- On the domination and signed domination numbers of zero-divisor graph
- Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two
- On construction for trees making the equality hold in Vizing's conjecture
- Dominating sets inducing large components
- Title not available (Why is that?)
- Restrained double Italian domination in graphs
- On the total and strong version for Roman dominating functions in graphs
- The compared costs of domination location-domination and identification
- Graphs with isolation number equal to one third of the order
- A sharp upper bound on the cycle isolation number of graphs
- Domination in edge cycle graphs
- Semi-strong split domination in graphs
- The minimum spectral radius of graphs with a given domination number
- Vertex-addition strategy for domination-like invariants
- Irredundance
- On domination numbers of zero-divisor graphs of commutative rings
- Graphs having distance-\(n\) domination number half their order
- Isolation of \(k\)-cliques. II
- On 2-step and hop dominating sets in graphs
- 3-component domination numbers in graphs
- Outer independent total double Italian domination number
- Proximity and remoteness in graphs: a survey
- The symmetric (2k, k)-graphs
- Dominating sets inducing large component in graphs with minimum degree two
This page was built for publication: Domination-balanced graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3950587)
