On distance-defined neighbor-distinguishing sets in graphs

zbMATH Open1339.05091MaRDI QIDQ2811694FDOQ2811694

Futaba Fujie-Okamoto, Ping Zhang, Bryan Phinezy

Publication date: 10 June 2016

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

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

• On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On distinct distance sets in a graph
• Nonlocal metric dimension of graphs

   Recommendations

• Title not available (Why is that?) 👍 👎
• Some bounds on the neighbor-distinguishing index of graphs 👍 👎
• On the neighbour-distinguishing index of a graph 👍 👎
• Distinct distance sets in a graph 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Different-Distance Sets in a Graph 👍 👎
• Distance neighbourhood domination in graphs 👍 👎
• Title not available (Why is that?) 👍 👎

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)