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

A note on non-dominating set partitions in graphs

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

DOI10.7151/dmgt.1895zbMath1350.05120OpenAlexW2404622858MaRDI QIDQ339496

Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning

Publication date: 11 November 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1895

zbMATH Keywords

dominationtotal dominationnon-dominating partitionnontotal dominating partition


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)


Related Items

Connected hop domination in graphs under some binary operations, Unnamed Item



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Remarks about disjoint dominating sets
  • Pairs of disjoint dominating sets in connected cubic graphs
  • Graph-theoretic parameters concerning domination, independence, and irredundance
  • Approximating theDomatic Number
  • Total Domination in Graphs
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:339496&oldid=12213088"
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 03:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki