On distance-defined neighbor-distinguishing sets in graphs

zbMATH Open1339.05091MaRDI QIDQ2811694FDOQ2811694

Authors: Futaba Fujie-Okamoto, Bryan Phinezy, Ping Zhang 

Publication date: 10 June 2016

Published in: Utilitas Mathematica (Search for Journal in Brave)

Recommendations

• Publication:3199436
• Some bounds on the neighbor-distinguishing index of graphs
• On the neighbour-distinguishing index of a graph
• Distinct distance sets in a graph
• scientific article; zbMATH DE number 5972334
• scientific article; zbMATH DE number 1186103
• Different-distance sets in a graph
• Distance neighbourhood domination in graphs
• Distance pattern distinguishing sets in graphs

zbMATH Keywords

distancelocal metric dimensionlocal metric setminimal local metric setupper local metric dimension

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cited In (9)

• On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
• The local metric dimension of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• On local metric dimensions of graphs
• Classifying Resolving Lists by Distances between Members
• Neighbor-distinguishing metric sets -- results and open questions
• On distinct distance sets in a graph
• Nonlocal metric dimension of graphs

This page was built for publication: On distance-defined neighbor-distinguishing sets in graphs

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