One size resolvability of graphs

MaRDI QIDQ3626212zbMATH OpenFDO

Authors Sorakrit Kwancharone, Varaporn Saenpholphat, C. M.da Fonseca

Publication date 22 May 2009

zbMATH Keywords

one resolving numberone resolving setresolving set

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• The independent resolving number of a graph
• scientific article; zbMATH DE number 1990687
• Conditional resolvability in graphs: a survey
• Certain varieties of resolving sets of a graph
• scientific article; zbMATH DE number 2197925

Cited in

(3)

• One-factor resolvability of grid derived networks
• scientific article; zbMATH DE number 1990687 (Why is no real title available?)
• Graphs with distinguishing sets of size k

This page was built for publication: One size resolvability of graphs

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