2-Distance paired-dominating number of graphs

Kan Yu () and Mei Lu ()
Additional contact information
Kan Yu: Tsinghua University
Mei Lu: Tsinghua University

Journal of Combinatorial Optimization, 2014, vol. 28, issue 4, No 9, 827-836

Abstract: Abstract Let $$G=(V,E)$$ be a simple graph without isolated vertices. For a positive integer $$k$$ , a subset $$D$$ of $$V(G)$$ is a $$k$$ -distance paired-dominating set if each vertex in $$V\setminus {D}$$ is within distance $$k$$ of a vertex in $$D$$ and the subgraph induced by $$D$$ contains a perfect matching. In this paper, we give some upper bounds on the 2-distance paired-dominating number in terms of the minimum and maximum degree, girth, and order.

Keywords: Graph; 2-Distance paired-dominating number; Degree; Girth (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9584-6 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:28:y:2014:i:4:d:10.1007_s10878-012-9584-6

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

DOI: 10.1007/s10878-012-9584-6

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 ().