An efficient algorithm for distance total domination in block graphs

Yancai Zhao () and Erfang Shan
Additional contact information
Yancai Zhao: Wuxi City College of Vocational Technology
Erfang Shan: Shanghai University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 24, 372-381

Abstract: Abstract The $$k$$ k -distance total domination problem is to find a minimum vertex set $$D$$ D of a graph such that every vertex of the graph is within distance $$k$$ k from some vertex of $$D$$ D other than itself, where $$k$$ k is a fixed positive integer. In the present paper, by using a labeling method, we design an efficient algorithm for solving the $$k$$ k -distance total domination problem on block graphs, a superclass of trees.

Keywords: Graph algorithm; Total domination; $$k$$ k -Distance total domination; Block graph; 05C85; 05C69 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9758-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:31:y:2016:i:1:d:10.1007_s10878-014-9758-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9758-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().