On the Distance Pattern Distinguishing Number of a Graph

Sona Jose and Germina K. Augustine

Journal of Applied Mathematics, 2014, vol. 2014, 1-8

Abstract:

Let be a connected simple graph and let be a nonempty subset of . The -distance pattern of a vertex in is the set of all distances from to the vertices in . If the distance patterns of all vertices in are distinct, then the set is a distance pattern distinguishing set of . A graph with a distance pattern distinguishing set is called a distance pattern distinguishing graph. Minimum number of vertices in a distance pattern distinguishing set is called distance pattern distinguishing number of a graph. This paper initiates a study on the problem of finding distance pattern distinguishing number of a graph and gives bounds for distance pattern distinguishing number. Further, this paper provides an algorithm to determine whether a graph is a distance pattern distinguishing graph or not and hence to determine the distance pattern distinguishing number of that graph.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2014/328703.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2014/328703.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:jnljam:328703

DOI: 10.1155/2014/328703

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().