119
Views
1
CrossRef citations to date
0
Altmetric
Section A

On the locatic number of graphs

, &
Pages 912-920 | Received 18 Apr 2012, Accepted 02 Nov 2012, Published online: 14 Feb 2013
 

Abstract

A vertex v of a connected graph G distinguishes a pair u, w of vertices of G if d(v, u)≠d(v, w), where d(·,·) denotes the length of a shortest path between two vertices in G. A k-partition Π={S 1, S 2, …, S k } of the vertex set of G is said to be a locatic partition if for every pair of distinct vertices v and w of G, there exists a vertex sS i for all 1≤ik that distinguishes v and w. The cardinality of a largest locatic partition is called the locatic number of G. In this paper, we study the locatic number of paths, cycles and characterize all the connected graphs of order n having locatic number n, n−1 and n−2. Some realizable results are also given in this paper.

2010 AMS Subject Classification :

Acknowledgements

This research of the authors was partially supported by the Higher Education Commission of Pakistan (Grant No. 17-5-3(Ps3-257) HEC/Sch/2006).

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.