Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

2-distance paired-dominating number of graphs

From MaRDI portal
Publication:489733
Jump to:navigation, search

DOI10.1007/s10878-012-9584-6zbMath1332.05110OpenAlexW1993054060MaRDI QIDQ489733

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

zbMATH Keywords

graphdegreegirth2-distance paired-dominating number


Mathematics Subject Classification ID

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




Cites Work

  • On the distance paired domination of generalized Petersen graphs \(P(n,1)\) and \(P(n,2)\)
  • Paired-domination in claw-free cubic graphs
  • Graphs with large paired-domination number
  • Upper bounds on the paired-domination number
  • Distance paired domination numbers of graphs
  • Paired-domination in graphs
  • On Representatives of Subsets
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:489733&oldid=12370655"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 06:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki