Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance

DOI10.1016/0166-218X(94)90011-6zbMath0815.05038OpenAlexW1996474894MaRDI QIDQ1343143

Gerd H. Fricke, Grant A. Cheston

Publication date: 1 February 1995

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90011-6

zbMATH Keywords

joinindependence numberupper irredundance numberdominating setsdominating functionstrongly perfect graphsirredundant setupper domination numberfractional domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

Using maximality and minimality conditions to construct inequality chains ⋮ Isoperimetry, stability, and irredundance in direct products ⋮ Graphs with equal domination and certified domination numbers ⋮ Directed domination in oriented graphs ⋮ A note on graphs which have upper irredundance equal to independence ⋮ Fractional Dominating Parameters ⋮ Upper domination and upper irredundance perfect graphs ⋮ Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irredundancy in circular arc graphs
• A note on graphs which have upper irredundance equal to independence
• On the computational complexity of upper fractional domination
• The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
• Topics on perfect graphs
• Coloring perfect \((K_ 4\)-e)-free graphs
• Alternating orientation and alternating colouration of perfect graphs
• Slender graphs
• Fractional matchings and the Edmonds-Gallai theorem
• Murky graphs
• Two classes of perfect graphs
• The strong perfect graph conjecture for pan-free graphs
• Fractional matchings and covers in infinite hypergraphs
• Strong tree-cographs are Birkhoff graphs
• Contributions to the theory of domination, independence and irredundance in graphs
• Maximum degree and fractional matchings in uniform hypergraphs
• Chordal graphs and upper irredundance, upper domination and independence
• On slim graphs, even pairs, and star-cutsets
• Stability, domination and irredundance in a graph
• Packing Problems and Hypergraph Theory: A Survey
• Properties of Hereditary Hypergraphs and Middle Graphs
• The Private Neighbor Cube
• On the Fractional Covering Number of Hypergraphs

This page was built for publication: Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance