A generalization of Vizing's theorem on domination

DOI10.1016/0012-365X(94)90286-0zbMath0792.05077OpenAlexW2079806359MaRDI QIDQ1318834

Jason Fulman

Publication date: 4 April 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90286-0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items

More on the unimodality of domination polynomial of a graph ⋮ Optimal linear‐Vizing relationships for (total) domination in graphs ⋮ Maximum sizes of graphs with given domination parameters ⋮ Relating the size of a connected graph to its total and restricted domination numbers ⋮ Domination number and neighbourhood conditions

Cites Work

• Maximum number of edges in connected graphs with a given domination number
• Unnamed Item