Relationships between total domination, order, size, and maximum degree of graphs
From MaRDI portal
Publication:3594954
Recommendations
- A linear Vizing‐like relation relating the size and total domination number of a graph
- scientific article; zbMATH DE number 2076802
- scientific article; zbMATH DE number 1462928
- scientific article; zbMATH DE number 1895061
- Total domination and total domination subdivision number of a graph and its complement
Cited in
(10)- Total domination in partitioned 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
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
- A linear Vizing‐like relation relating the size and total domination number of a graph
- Optimal linear‐Vizing relationships for (total) domination in graphs
- Distance domination and linear-vizing constants
- Domination in 4-regular graphs with no induced 4-cycles
- More on limited packings in graphs
- A survey of selected recent results on total domination in graphs
This page was built for publication: Relationships between total domination, order, size, and maximum degree of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3594954)