Distance domination in graphs with given minimum and maximum degree

DOI10.1007/s10878-016-0091-zzbMath1381.05051OpenAlexW2539118086MaRDI QIDQ2410104

Nicolas Lichiardopol, Michael A. Henning

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0091-z

zbMATH Keywords

minimum degreemaximum degreedistance domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Vertex degrees (05C07)

Related Items (5)

A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph ⋮ The minimum number of vertices in uniform hypergraphs with given domination number ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Which graphs occur as \(\gamma\)-graphs? ⋮ Distance Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on distance-dominating cycles
• On packing and covering numbers of graphs
• Relations between packing and covering numbers of a tree
• Distance domination and distance irredundance in graphs
• A lower bound for the distance \(k\)-domination number of trees
• Planar Formulae and Their Uses
• R -Domination in Graphs

This page was built for publication: Distance domination in graphs with given minimum and maximum degree