The sequence of upper and lower domination, independence and irredundance numbers of a graph
From MaRDI portal
Publication:1313851
DOI10.1016/0012-365X(93)90288-5zbMath0788.05055OpenAlexW2048864944WikidataQ128081504 ScholiaQ128081504MaRDI QIDQ1313851
E. J. Cockayne, Christina M. Mynhardt
Publication date: 10 March 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90288-5
Related Items
Construction of Halin graph with perfect k-ary tree and its independent domination number, Irredundance perfect graphs, Using maximality and minimality conditions to construct inequality chains, Domination chain: characterisation, classical complexity, parameterised complexity and approximability, On (r,s)-Fuzzy Domination in Fuzzy Graphs, Towards a new framework for domination, The complexity of irredundant sets parameterized by size, Triangulations and equality in the domination chain, The total irredundance numbers on graphs, Irredundance, On the ratios between packing and domination parameters of a graph, A Characterization of the extended DII-sequence, Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- On generalised minimal domination parameters for paths
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Stability, domination and irredundance in a graph
- Total domination in graphs
- Towards a theory of domination in graphs
- Properties of Hereditary Hypergraphs and Middle Graphs
