Conditional resolvability in graphs: a survey

Varaporn Saenpholphat and Ping Zhang

International Journal of Mathematics and Mathematical Sciences, 2004, vol. 2004, 1-21

Abstract:

For an ordered set W = { w 1 , w 2 , … , w k } of vertices and a vertex v in a connected graph G , the code of v with respect to W is the k -vector c W ( v ) = ( 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 a resolving set for G if distinct 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 different 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 defined by imposing an additional constraint on resolving sets, resolving partitions, or resolving decompositions in graphs.

Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2004/247096.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2004/247096.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:247096

DOI: 10.1155/S0161171204311403

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().