Ubaya Repository (University of Surabaya) · 2010 · 12 citations · 9 references
Open access
ComputingComputer ScienceCombinatoricsData StructuresRepresentation TheoryDirected Acyclic GraphsGraph AlgorithmsGraph TheoryGraphical RepresentationAmalgamationVertex DistanceVertex Representation
For an ordered set W = {w_1,w_2,...,w_k} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W) = (d(v,w_1),d(v,w_2),...,d(v,w_k)) where d(x,y) represents the distance between the vertices x and y. The set W is called a resolving set for G if every vertex of G has \na distinct representation. A resolving set containing a minimum number of vertices is called a basis for G. The dimension of G, denoted by dim(G), is the number of vertices in a basis of G. A resolving set W of G is connected if the subgraph <W> induced by W is a nontrivial connected subgraph of G. The connected resolving number is the minimum cardinality of a connected resolving set in a \ngraph G, denoted by cr(G). A cr-set of G is a connected resolving set with cardinality cr(G). A connected graph H is a resolving graph if there is a graph G with a cr-set W such that <W> = H. Let {G_i} be a finite collection of graphs and each G_i has a fixed vertex v_{oi} called a terminal. The amalgamation Amal{Gi,v_{oi}} is formed by \ntaking of all the G_i's and identifying their terminals. In this paper, we determine the connected resolving number and characterize the resolving graphs of amalgamation of cycles.
9
A Dynamic Survey of Graph Labeling
Joseph A. Gallian · The Electronic Journal of Combinatorics · 2022 · 2.2K citations · Full text
Resolvability in graphs and the metric dimension of a graph
Gary Chartrand, Linda Eroh, Mark A. Johnson et al. · Discrete Applied Mathematics · 2000 · 982 citations
Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld · Discrete Applied Mathematics · 1996 · 808 citations
On the metric dimension of some families of graphs
Carmen Hernando, Mercè Ferrater Mora, Ignacio M. Pelayo et al. · Electronic Notes in Discrete Mathematics · 2005 · 165 citations