The multiresolving sets of graphs with prescribed multisimilar equivalence classes

DOI10.1155/2018/8978193zbMath1486.05156OpenAlexW2886634270WikidataQ129428118 ScholiaQ129428118MaRDI QIDQ2330269

Supachoke Isariyapalakul, Varanoot Khemmani

Publication date: 28 October 2019

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/8978193

zbMATH Keywords

equivalence classesconnected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number ⋮ The multibases of symmetric caterpillars ⋮ Distance-based vertex identification in graphs: the outer multiset dimension ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resolvability in graphs and the metric dimension of a graph

This page was built for publication: The multiresolving sets of graphs with prescribed multisimilar equivalence classes