Conditional resolvability in graphs a survey英文文献资料.docVIP

CONDITIONALRESOLVABILITYINGRAPHS:ASURVEY VARAPORN SAENPHOLPHAT andPINGZHANG Received 29November 2003 ForanorderedsetW ={w1,w2,...,wk}ofverticesandavertexvinaconnectedgraphG ,the codeofvwithrespecttoW isthek-vectorc (v) =(d(v,w ),d(v,w ),...,d(v,w )) ,where W 1 2 k d(x,y)represents thedistancebetweentheverticesxandy.ThesetW isaresolving setfor G ifdistinct vertices of G have distinct codes with respect to W.The minimum cardinality of a resolving set for G is its dimension dim(G). Many resolving parameters are formed by extending resolving sets to di?erent subjects in graph theory, such as the partition of the vertex set, decomposition, and coloring in graphs, or by combining resolving property with another graph-theoretic property such as being connected, independent, or acyclic. In this paper, we survey results and open questions on the resolving parameters de?ned by imposing an additional constraint on resolving sets, resolving partitions, or resolving decompositions ingraphs. 2000 Mathematics Subject Classi?cation: 05C12, 05C20, 05C90. 1. Introduction. Wereferto[13]forgraphicaltheoretical notationandterminology not described in this paper. The distance d(u,v) between two vertices u and v in a connected graph G is the length of a shortest u?v path in G. For an ordered set W ={w ,w ,...,w }?V(G)andavertexv ofG,thek-vector 1 2 k



 cW(v)= d v,w1 ,d v,w2 ,...,d v,wk (1.1) isthe code ofv with respect to W.The set W iscalled aresolving set for G ifdistinct vertices have distinct codes with respect toW.Aresolving setcontaining aminimum numberofverticesisaminimumresolvingset orabasis forG.The(metric)dimension dim(G)isthenumberofverticesinabasisforG. Forexample,considerthegraphGshowninFigure1.1.TheorderedsetW1={v1,v3} is not a resolving set for G since cW (v )=(1,1)=c (v ), that is, G contains two 2 W1 4 1 vertices withthesamecode.Ontheotherhand,W ={v1,v2,v3}isaresolving setfor 2 GsincethecodesfortheverticesofGwithrespe