scientific article; zbMATH DE number 1990687

MaRDI QIDQ4430850zbMATH OpenFDO

Authors Varaporn Saenpholphat, Ping Zhang

Publication date 13 October 2003

zbMATH Keywords

connected resolving numberdimensiondistanceresolving graphresolving set

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• scientific article; zbMATH DE number 2197925
• Connected Resolvability of Graphs
• One size resolvability of graphs
• scientific article; zbMATH DE number 1998282
• The independent resolving number of a graph

Cited in

(12)

• Resolvability and the upper dimension of graphs
• Conditional resolvability in graphs: a survey
• a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution
• The resolving graph of amalgamation of cycles
• Connected Resolvability of Graphs
• One size resolvability of graphs
• Connected resolving decompositions in graphs
• scientific article; zbMATH DE number 1998282 (Why is no real title available?)
• Classifying Resolving Lists by Distances between Members
• scientific article; zbMATH DE number 2197925 (Why is no real title available?)
• On study of some bounds for fault-tolerant metric dimension and adjacency fault-tolerant resolving set of corona product graphs
• On the metric dimension and spectrum of graphs

This page was built for publication:

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