Using maximality and minimality conditions to construct inequality chains

DOI10.1016/S0012-365X(96)00356-1zbMath0887.05031OpenAlexW2119042505MaRDI QIDQ1377679

Stephen T. Hedetniemi, E. J. Cockayne, Sandra M. Hedetniemi, Alice A. McRae, Johannes H. Hattingh

Publication date: 6 May 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00356-1

zbMATH Keywords

dominationinequality chainirredundance numbers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

On weakly connected domination in graphs ⋮ On (r,s)-Fuzzy Domination in Fuzzy Graphs ⋮ The Private Neighbor Concept ⋮ Vertex sequences in graphs

Cites Work

• A note on graphs which have upper irredundance equal to independence
• On domination and independent domination numbers of a graph
• Gallai theorems for graphs, hypergraphs, and set systems
• A survey of the theory of hypercube graphs
• A characterization of well covered graphs of girth 5 or greater
• The sequence of upper and lower domination, independence and irredundance numbers of a graph
• Parallel concepts in graph theory
• Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
• The diversity of domination
• Independent domination in hypercubes
• Minimum Edge Dominating Sets
• Enclaveless sets and MK-Systems
• Total matchings and total coverings of graphs
• Towards a theory of domination in graphs
• Properties of Hereditary Hypergraphs and Middle Graphs
• On some subclasses of well-covered graphs
• The ratio of the distance irredundance and domination numbers of a graph
• The Private Neighbor Cube
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Atom probe tomography characterization of solute segregation to dislocations and interfaces
• Linear-time computation of optimal subgraphs of decomposable graphs
• Two Bounds for the Domination Number of a Graph
• Some covering concepts in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using maximality and minimality conditions to construct inequality chains