Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Maximin degree domination number in graphs and its critical aspects

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

DOI10.12732/IEJPAM.V6I3.5zbMATH Open1399.05171OpenAlexW2320095626MaRDI QIDQ2962499FDOQ2962499


Authors: S. S. Kamath, Prameela Kolake Edit this on Wikidata


Publication date: 16 February 2017

Published in: International Electronic Journal of Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.e.ijpam.eu/contents/articles/201300603005.pdf




Recommendations

  • On maximum total domination vertex critical graphs
  • On domination parameters and maximum degree of a graph
  • Domination in Graphs
  • Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
  • On the domination number of graphs with minimum degree six


zbMATH Keywords

dominationtotal dominationconnected dominationcritical elementsfixed elementsfree elementscomplement of the graphmaximin degree domination numberredundant elementstotally free elements


Mathematics Subject Classification ID

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







This page was built for publication: Maximin degree domination number in graphs and its critical aspects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2962499)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2962499&oldid=15957981"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 20:18. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki