Optimal linear‐Vizing relationships for (total) domination in graphs

DOI10.1002/JGT.23070OpenAlexW4389894372MaRDI QIDQ6201029

No author found.

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

zbMATH Keywords

sizeordermaximum degree(total) domination in graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Maximum number of edges in connected graphs with a given domination number
• A generalization of Vizing's theorem on domination
• Transversal numbers of uniform hypergraphs
• Maximum sizes of graphs with given domination parameters
• Relating the size of a connected graph to its total and restricted domination numbers
• 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”
• Relationships between total domination, order, size, and maximum degree of graphs
• Total domination in graphs
• A linear vizing-like relation between the size and the domination number of a graph
• The dominating number of a random cubic graph
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Total Domination in Graphs
• Domination in Graphs: Core Concepts
• Structures of Domination in Graphs
• Topics in Domination in Graphs
• A linear Vizing‐like relation relating the size and total domination number of a graph

This page was built for publication: Optimal linear‐Vizing relationships for (total) domination in graphs