Optimal linear‐Vizing relationships for (total) domination in graphs
From MaRDI portal
Publication:6201029
DOI10.1002/JGT.23070OpenAlexW4389894372MaRDI QIDQ6201029FDOQ6201029
Author name not available (Why is that?)
Publication date: 25 March 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.23070
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Transversal numbers of uniform hypergraphs
- Total domination in graphs
- Total Domination in Graphs
- 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
- A linear vizing-like relation between the size and the domination number of a graph
- Relationships between total domination, order, size, and maximum degree of graphs
- Domination in Graphs: Core Concepts
- Topics in Domination in Graphs
- Erratum to: “A linear vizing-like relation relating the size and total domination number of a graph”
- The dominating number of a random cubic graph
- A linear Vizing‐like relation relating the size and total domination number of a graph
- A generalization of Vizing's theorem on domination
- Structures of Domination in Graphs
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
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)
