Bounds on the distance two-domination number of a graph

DOI10.1007/s003730200050zbMath1009.05105OpenAlexW2034312055MaRDI QIDQ1865157

M. D. Elias, V. S. A. Subramanian, N. S. Sridharan

Publication date: 25 March 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730200050

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)

Related Items (6)

Eternal distance-\(k\) domination on graphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ Distance domination, guarding and covering of maximal outerplanar graphs ⋮ An Algorithm for the Inverse Distance-2 Dominating Set of a Graph ⋮ Some new results on distance \(k\)-domination in graphs ⋮ On disjunctive domination in graphs

This page was built for publication: Bounds on the distance two-domination number of a graph