A Labeling Algorithm for Distance Domination on Block Graphs

The ...-distance domination problem is to find a minimum vertex set ... of a graph such that every vertex of the graph is either in ... or within distance ... from some vertex of ..., where ... is a positive integer. In the present paper, by using labeling method, a linear-time algorithm for ...-dis...

Full description

Saved in:
Bibliographic Details
Published inBulletin of the Malaysian Mathematical Sciences Society Vol. 37; no. 4
Main Authors Zhao, Yancai, Shan, Erfang, Liang, Zuosong, Gao, Ruzhao
Format Journal Article
LanguageEnglish
Published Heidelberg Springer Nature B.V 01.01.2014
Subjects
Mathematics
Online AccessGet full text
ISSN0126-6705
2180-4206

Cover

More Information
Summary:The ...-distance domination problem is to find a minimum vertex set ... of a graph such that every vertex of the graph is either in ... or within distance ... from some vertex of ..., where ... is a positive integer. In the present paper, by using labeling method, a linear-time algorithm for ...-distance domination problem on block graphs is designed. 2010 Mathematics Subject Classification: 05C69, 05C12 (ProQuest: ... denotes formulae omitted.)
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0126-6705
2180-4206