Trees with maximum \(p\)-reinforcement number
type: Item
instance of: scholarly article
title: Trees with maximum \(p\)-reinforcement number
zbMATH Open document ID: 1298.05072
author: You Lu
author: Jun-Ming Xu
published in: Discrete Applied Mathematics
publication date: 2014-08-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1211.5742
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6334396
zbMATH Keywords: \(p\)-domination
zbMATH Keywords: \(p\)-reinforcement number
MaRDI profile type: Publication
OpenAlex ID: W2157849389
arXiv ID: 1211.5742
cites work: On domination and reinforcement numbers in trees
cites work: Q5709011
cites work: Some bounds on the \(p\)-domination number in trees
cites work: A note on the k-domination number of a graph
cites work: \(k\)-domination and \(k\)-independence in graphs: A survey
cites work: Q4809827
cites work: Bounds on the \(k\)-domination number of a graph
cites work: On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
cites work: Onk-domination and minimum degree in graphs
cites work: Q3691778
cites work: Independence andk-domination in graphs
cites work: A note on total reinforcement in graphs
cites work: On the complexity of the bondage and reinforcement problems
cites work: Reinforcement numbers of digraphs
cites work: Q5284099
cites work: Trees with unique minimum \(p\)-dominating sets
cites work: Theory and Application of Graphs
cites work: Q4655867
DOI: 10.1016/J.DAM.2014.05.022
description: scientific article; zbMATH DE number 6334396