Hop domination in graphs. II

MaRDI QIDQ2806683zbMATH OpenFDO

Authors C. Natarajan, S. K. Ayyaswamy

Publication date 18 May 2016

Published in Analele Științifice ale Universității ``Ovidius Constanța. Seria: Matematică (Search for Journal in Brave)

zbMATH Keywords

total domination numberconnected domination numberHop domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• Graphs with small and large hop domination numbers
• Bounds on the hop domination number of a tree
• On hop domination number of some generalized graph structures
• Locating-hop domination in graphs
• On hop Roman domination in trees

Cited in

(25)

• THE FORCING HOP DOMINATION NUMBER OF A GRAPH
• Certified hop domination in graphs
• Locating-hop domination in graphs
• Non split hop domination number for some mirror graphs and Cartesian product of two distinct paths
• Algorithm and hardness results on hop domination in graphs
• Total hop dominating sets in the join, corona and lexicographic product of graphs
• On hop domination number of some generalized graph structures
• The geodetic hop domination number of complementary prisms
• Hop total Roman domination in graphs
• An optimal algorithm to find minimum k-hop dominating set of interval graphs
• Further results on the hop domination number of a graph
• On hop Roman domination in trees
• On the complexity of some hop domination parameters
• Graphs with small and large hop domination numbers
• On the \(k\)-hop domination numbers of spanning trees of unicyclic graphs
• Double hop dominating sets in graphs
• Connected perfect hop dominating sets under some binary operations
• Bounds on the hop domination number of a tree
• Hop domination polynomial of graphs
• Clone hop domination number of a graph
• Connected hop domination in graphs under some binary operations
• On total domination and hop domination in diamond-free graphs
• On 2-step and hop dominating sets in graphs
• Edge-vertex domination on interval graphs
• An optimal algorithm to find minimum \(k\)-hop connected dominating set of permutation graphs

This page was built for publication: Hop domination in graphs. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806683)