Optimal linear‐Vizing relationships for (total) domination in graphs
From MaRDI portal
(Redirected from Optimal linear‐Vizing relationships for (total) domination in graphs)
Recommendations
- A linear Vizing‐like relation relating the size and total domination number of a graph
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
- A linear vizing-like relation between the size and the domination number of a graph
- scientific article; zbMATH DE number 2076802
- Relationships between total domination, order, size, and maximum degree of graphs
Cites work
- A generalization of Vizing's theorem on domination
- A linear vizing-like relation between the size and the domination number of a graph
- A linear Vizing‐like relation relating the size and total domination number of a graph
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Domination in Graphs: Core Concepts
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
- Erratum to: “A linear vizing-like relation relating the size and total domination number of a graph”
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- scientific article; zbMATH DE number 3221976 (Why is no real title available?)
- scientific article; zbMATH DE number 2230938 (Why is no real title available?)
- Maximum number of edges in connected graphs with a given domination number
- Maximum sizes of graphs with given domination parameters
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Relating the size of a connected graph to its total and restricted domination numbers
- Relationships between total domination, order, size, and maximum degree of graphs
- Structures of domination in graphs
- The dominating number of a random cubic graph
- Topics in Domination in Graphs
- Total domination in graphs
- Total domination in graphs
- Transversal numbers of uniform hypergraphs
This page was built for publication: Optimal linear‐Vizing relationships for (total) domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201029)
