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

Distance neighbourhood domination in graphs

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

zbMATH Open1236.05148MaRDI QIDQ417063FDOQ417063

B. Janakiram, N. D. Soner, Maliakkal Antony Davis

Publication date: 12 May 2012

Published in: National Academy Science Letters (Search for Journal in Brave)




zbMATH Keywords

distance neighborhood dominating numberdistance neighborhood dominating set


Mathematics Subject Classification ID

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



Cited In (6)

  • Neighborhood principle driven ICF algorithm and graph distance calculations
  • On distance-defined neighbor-distinguishing sets in graphs
  • Title not available (Why is that?)
  • Graph Domination in Distance Two
  • On orbital domination numbers of graphs
  • The nm-domination number of a graph






This page was built for publication: Distance neighbourhood domination in graphs

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

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