A labeling algorithm for distance domination on block graphs

MaRDI QIDQ472649zbMATH OpenFDO

Authors Erfang Shan, Zuosong Liang, Ruzhao Gao, Yancai Zhao

Publication date 19 November 2014

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL http://math.usm.my/bulletin/html/vol37_4_5.html

zbMATH Keywords

block graphdistance domination

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An efficient algorithm for distance total domination in block graphs
• scientific article; zbMATH DE number 6531253
• Algorithmic aspects of the \(k\)-domination problem in graphs
• An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
• The k-neighbor domination problem

Cited in

(4)

• An efficient algorithm for distance total domination in block graphs
• Domination-related parameters in rooted product graphs
• Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
• The k-neighbor domination problem

This page was built for publication: A labeling algorithm for distance domination on block graphs

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