The p-domination number of complete multipartite graphs

DOI10.1142/S1793830914500633zbMath1303.05143arXiv1205.0102OpenAlexW2105664102MaRDI QIDQ2931929

You Lu, Jun-Ming Xu

Publication date: 28 November 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.0102

zbMATH Keywords

complete multipartite graph\(p\)-domination number\(p\)-domination set

Mathematics Subject Classification ID

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

Related Items (1)

On the complexity of multiple bondage in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(k\)-domination and \(k\)-independence in graphs: A survey
• A note on the k-domination number of a graph
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• Bounds on the \(k\)-domination number of a graph
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Some bounds on the \(p\)-domination number in trees
• Bounds for the 2-domination number of toroidal grid graphs

This page was built for publication: The p-domination number of complete multipartite graphs