A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
From MaRDI portal
Publication:400496
DOI10.1016/j.dam.2014.03.013zbMath1297.05179OpenAlexW2025711606WikidataQ123019622 ScholiaQ123019622MaRDI QIDQ400496
Michael A. Henning, Anders Yeo
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.013
Related Items (10)
A new lower bound on the total domination number of a graph ⋮ Bounds on the sum of domination number and metric dimension of graphs ⋮ On domination number and distance in graphs ⋮ Total domination versus domination in cubic graphs ⋮ Triameter of graphs ⋮ Coupon-coloring and total domination in Hamiltonian planar triangulations ⋮ On upper total domination versus upper domination in graphs ⋮ On k-Total Dominating Graphs ⋮ A classification of cactus graphs according to their total domination number ⋮ A note on the triameter of graphs
Cites Work
This page was built for publication: A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
