Maximum number of edges in connected graphs with a given domination number

DOI10.1016/0012-365X(91)90071-9zbMath0739.05050OpenAlexW2069267595MaRDI QIDQ1174141

Laura A. Sanchis

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90071-9

Mathematics Subject Classification ID

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

Related Items

Sizes and transmissions of digraphs with a given clique number ⋮ Some results on characterizing the edges of connected graphs with a given domination number ⋮ Maximum size of digraphs with some parameters ⋮ New results about the bondage number of a graph ⋮ Traceability of connected domination critical graphs ⋮ LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER ⋮ Average distance and domination number ⋮ Optimal linear‐Vizing relationships for (total) domination in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ On the spectral radius of graphs with a given domination number ⋮ Generating hard and diverse test sets for NP-hard graph problems ⋮ Maximum sizes of graphs with given domination parameters ⋮ Relating the size of a connected graph to its total and restricted domination numbers ⋮ Bounds on neighborhood total domination number in graphs ⋮ Domination number and neighbourhood conditions ⋮ Upper bounds on the bondage number of a graph ⋮ A generalization of Vizing's theorem on domination

Cites Work

• Domination alteration sets in graphs
• Minimum number of edges in graphs that are both \(P_ 2-\) and \(P_ i- \)connected
• Towards a theory of domination in graphs
• Domination critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum number of edges in connected graphs with a given domination number