Distance neighbourhood domination in graphs
From MaRDI portal
Publication:417063
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)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cited In (8)
- 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
- The step domination number of a graph
- On orbital domination numbers of graphs
- Title not available (Why is that?)
- 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)