Disproof of a conjecture in the domination theory

DOI10.1007/BF02986690zbMath0813.05038OpenAlexW2075620591WikidataQ122983345 ScholiaQ122983345MaRDI QIDQ1343234

Igor Edm. Zverovich, Vadim E. Zverovich

Publication date: 1 February 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02986690

zbMATH Keywords

connectivityregular graphscubic graphsdominating setindependent domination numberdomination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (4)

Domination versus independent domination in cubic graphs ⋮ On the independent domination number of regular graphs ⋮ On the differences between the upper irredundance, upper domination and independence numbers of a graph ⋮ Independent Domination in Triangle Graphs

Cites Work

• What is the difference between the domination and independent domination numbers of a cubic graph?
• Unnamed Item
• Unnamed Item

This page was built for publication: Disproof of a conjecture in the domination theory