Equality in a linear Vizing-like relation that relates the size and total domination number of a graph

DOI10.1016/j.dam.2013.03.017zbMath1286.05121arXiv1108.5949OpenAlexW1991401784MaRDI QIDQ2446844

Michael A. Henning, Ernst J. Joubert

Publication date: 22 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.5949

zbMATH Keywords

sizeordertotal dominationmaximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Optimal linear‐Vizing relationships for (total) domination in graphs ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of selected recent results on total domination in graphs
• Covering all cliques of a graph
• Small transversals in hypergraphs
• Maximum sizes of graphs with given domination parameters
• Relating the size of a connected graph to its total and restricted domination numbers
• 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
• Hypergraphs with large transversal number and with edge sizes at least 3
• Total domination in 2-connected graphs and in graphs with no induced 6-cycles
• Total domination in graphs
• A linear vizing-like relation between the size and the domination number of a graph
• Some remarks on domination
• Graphs with large total domination number
• Total Domination in Graphs
• A linear Vizing‐like relation relating the size and total domination number of a graph

This page was built for publication: Equality in a linear Vizing-like relation that relates the size and total domination number of a graph