2-distance paired-dominating number of graphs
type: Item
instance of: scholarly article
title: 2-distance paired-dominating number of graphs
zbMATH Open document ID: 1332.05110
author: Kan Yu
author: Mei Lu
published in: Journal of Combinatorial Optimization
publication date: 2015-01-21T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6388501
zbMATH Keywords: graph
zbMATH Keywords: 2-distance paired-dominating number
zbMATH Keywords: degree
zbMATH Keywords: girth
MaRDI profile type: Publication
full work available at URL: s10878-012-9584-6
OpenAlex ID: W1993054060
cites work: Upper bounds on the paired-domination number
cites work: Paired-domination in claw-free cubic graphs
cites work: Q3838207
cites work: Paired-domination in graphs
cites work: On Representatives of Subsets
cites work: Graphs with large paired-domination number
cites work: Q4529313
cites work: Distance paired domination numbers of graphs
cites work: Q4820525
cites work: On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\)
DOI: 10.1007/S10878-012-9584-6
description: scientific article; zbMATH DE number 6388501