A linear vizing-like relation between the size and the domination number of a graph
From MaRDI portal
Publication:4261185
DOI<297::AID-JGT4>3.0.CO;2-1 10.1002/(SICI)1097-0118(199908)31:4<297::AID-JGT4>3.0.CO;2-1zbMath0940.05053OpenAlexW4242935866MaRDI QIDQ4261185
Publication date: 1 September 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199908)31:4<297::aid-jgt4>3.0.co;2-1
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Independent Domination in Cubic Graphs ⋮ Optimal linear‐Vizing relationships for (total) domination in graphs ⋮ Extremal \(P_4\)-stable graphs ⋮ Equality in a linear Vizing-like relation that relates the size and total domination number of a graph ⋮ Graphs with maximum size and given paired-domination number ⋮ Maximum sizes of graphs with given domination parameters
Cites Work
This page was built for publication: A linear vizing-like relation between the size and the domination number of a graph
