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

The least point covering and domination numbers of a graph

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

DOI10.1016/0012-365X(90)90356-MzbMath0744.05039MaRDI QIDQ1174131

E. Sampathkumar

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

least domination numberleast point covering numbertotal point cover


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)


Related Items (max. 100)

Total domination and least domination in a tree ⋮ Least domination in a graph ⋮ Proof of a conjecture in domination theory ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters



Cites Work

  • A note on total domination
  • Parallel concepts in graph theory
  • Total domination in graphs
  • Towards a theory of domination in graphs
  • Two Bounds for the Domination Number of a Graph
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: The least point covering and domination numbers of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1174131&oldid=11995561"
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 00:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki