Maximum sizes of graphs with given domination parameters
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1506495 (Why is no real title available?)
- scientific article; zbMATH DE number 3221976 (Why is no real title available?)
- A generalization of Vizing's theorem on domination
- A linear vizing-like relation between the size and the domination number of a graph
- Maximum number of edges in connected graphs with a given domination number
- Maximum size of a connected graph with given domination parameters
- On the number of edges in graphs with a given connected domination number
- Star forests, dominating sets and Ramsey-type problems
- Total domination in graphs
Cited in
(21)- On size, order, diameter and edge-connectivity of graphs
- My favorite domination conjectures in graph theory are bounded
- Graphs with maximum size and given paired-domination number
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
- An inequality that relates the size of a bipartite graph with its order and restrained domination number
- Equality in a bound that relates the size and the restrained domination number of a graph
- Extremal problems related to the cardinality-redundance of graphs
- A survey of selected recent results on total domination in graphs
- Some spin glass ideas applied to the clique problem
- scientific article; zbMATH DE number 5717187 (Why is no real title available?)
- Bounds on neighborhood total domination number in graphs
- On the characterization of the maximal connected bipartite graphs with given domination number
- Maximum size of digraphs with some parameters
- Upper bounds for domination related parameters in graphs on surfaces
- Extremal graphs for a new upper bound on domination parameters in graphs
- Optimal linear‐Vizing relationships for (total) domination in graphs
- scientific article; zbMATH DE number 5498807 (Why is no real title available?)
- Maximum size of a connected graph with given domination parameters
- Maximal core size in singular graphs
- Relating the size of a connected graph to its total and restricted domination numbers
- On size, order, diameter and minimum degree
This page was built for publication: Maximum sizes of graphs with given domination parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827704)