Domination in graphs of minimum degree five
From MaRDI portal
Publication:2494122
DOI10.1007/s00373-006-0638-3zbMath1091.05054OpenAlexW1989542562MaRDI QIDQ2494122
Liang Sun, Hua-Ming Xing, Xue-gang Chen
Publication date: 16 June 2006
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-006-0638-3
Related Items (16)
Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Domination number in graphs with minimum degree two ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Decreasing the maximum degree of a graph ⋮ Domination number of graphs with minimum degree five ⋮ A note on domination number in maximal outerplanar graphs ⋮ On dominating sets of maximal outerplanar and planar graphs ⋮ Tropical dominating sets in vertex-coloured graphs ⋮ On the domination number of Hamiltonian graphs with minimum degree six ⋮ A sharp upper bound on algebraic connectivity using domination number ⋮ Dominating sets in plane triangulations ⋮ A sharp upper bound on the least signless Laplacian eigenvalue using domination number ⋮ An upper bound on the domination number of a graph with minimum degree 2 ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5
Cites Work
This page was built for publication: Domination in graphs of minimum degree five
