Maximum sizes of graphs with given restrained domination numbers
From MaRDI portal
Publication:1946226
DOI10.1016/j.dam.2012.10.004zbMath1262.05087OpenAlexW2041202633MaRDI QIDQ1946226
Publication date: 18 April 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.004
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Equality in a bound that relates the size and the restrained domination number of a graph ⋮ Sizes and transmissions of digraphs with a given clique number ⋮ Unnamed Item ⋮ An inequality that relates the size of a bipartite graph with its order and restrained domination number ⋮ Restrained and Total Restrained Domination in Graphs
This page was built for publication: Maximum sizes of graphs with given restrained domination numbers
