Maximum sizes of graphs with given restrained domination numbers
From MaRDI portal
Publication:1946226
Recommendations
- An upper bound on the restrained domination number of graphs.
- All graphs with restrained domination number three less than their order
- Equality in a bound that relates the size and the restrained domination number of a graph
- Restrained domination in graphs with minimum degree two
- Graphs with large restrained domination number
Cited in
(13)- Graphs with large restrained domination number
- The product of the restrained domination numbers of a graph and its complement
- 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
- scientific article; zbMATH DE number 6383811 (Why is no real title available?)
- Global restrained domination number of a graph
- All graphs with restrained domination number three less than their order
- An upper bound on the restrained domination number of graphs.
- Restrained and total restrained domination in graphs
- Restrained domination polynomial in graphs
- An inequality that relates the size of a bipartite graph with its order and restrained domination number
- Extremal problems related to the cardinality-redundance of graphs
- Improving a bound that relates the size of a bipartite graph with its restrained domination number
This page was built for publication: Maximum sizes of graphs with given restrained domination numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946226)