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

The minus k-domination numbers in graphs

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

DOI10.22049/CCO.2016.13534zbMATH Open1365.05074OpenAlexW2528589113MaRDI QIDQ5269918FDOQ5269918

N. Dehgardi

Publication date: 28 June 2017


Full work available at URL: https://doaj.org/article/7de48aec39ab42949a4220881124425a



zbMATH Keywords

graphminus \(k\)-dominating functionminus \(k\)-domination number


Mathematics Subject Classification ID

Distance in graphs (05C12)



Cited In (12)

  • Minus \(k\)-subdomination in graphs
  • A proof of a conjecture of minus domination in graphs
  • A note on graphs with large girth and small minus domination number
  • Lower bounds on the minus domination and \(k\)-subdomination numbers.
  • On the signed strong Roman domination number of graphs
  • The minimum number of vertices in uniform hypergraphs with given domination number
  • Title not available (Why is that?)
  • The minus total k-domination numbers in graphs
  • Signed and Minus Dominating Functions in Graphs
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Title not available (Why is that?)






This page was built for publication: The minus $k$-domination numbers in graphs

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

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