Distance neighbourhood domination in graphs

zbMATH Open1236.05148MaRDI QIDQ417063FDOQ417063

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

Publication date: 12 May 2012

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

Recommendations

• Distance domination in graphs
• scientific article; zbMATH DE number 1124605
• A note on distance domination numbers of graphs
• Distance domination in graphs with given minimum and maximum degree
• scientific article; zbMATH DE number 3914370

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 (15)

• 3-distance domination numbers of some graphs
• Distance majorization sets in graphs
• Neighborhood principle driven ICF algorithm and graph distance calculations
• Secondary and internal distances of sets in graphs
• 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 dominated graphs
• A contribution to upper domination, irredundance and distance-2 domination in graphs
• On orbital domination numbers of graphs
• Distance domination in graphs
• Title not available (Why is that?)
• The extended dominating sets in 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)