2-distance paired-dominating number of graphs

DOI10.1007/S10878-012-9584-6zbMATH Open1332.05110OpenAlexW1993054060MaRDI QIDQ489733FDOQ489733

Authors: Kan Yu, Mei Lu 

Publication date: 21 January 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9584-6

Recommendations

• Distance paired domination numbers of graphs
• On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\)
• Upper bounds on the paired-domination number
• On the distance domination number of bipartite graphs
• On the distance paired-domination of circulant graphs

zbMATH Keywords

graphgirthdegree2-distance paired-dominating number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Paired-domination in claw-free cubic graphs
• On Representatives of Subsets
• Paired-domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper bounds on the paired-domination number
• Distance paired domination numbers of graphs
• On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\)
• Graphs with large paired-domination number

Cited In (4)

• Distance-2 domatic numbers of grid graphs
• Distance paired domination numbers of graphs
• Two-distance-primitive graphs
• On the distance paired-domination of circulant graphs

This page was built for publication: 2-distance paired-dominating number of graphs

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