Hiindex LOGO

Research Article

On Strong Metric Dimension Of Diametrically Ver-tex Uniform Graphs


Author(s): Cyriac Grigorious , Sudeep Stephen,Albert William
Affiliation: Department of Mathematics, Loyola College, Chennai, India
Year of Publication: 2014
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:

<a href="http://www.hindex.org/2014/article.php?page=820"><img src="http://www.hindex.org/sai.php/2014SCIA316F0820" alt="SAI"></a>


File:

http://www.hindex.org/2014/p820.pdf


Citation: Cyriac Grigorious, Sudeep Stephen,Albert William. "On Strong Metric Dimension Of Diametrically Ver-tex Uniform Graphs." International Journal of Computing Algorithm 3.2 (2014): 114-116.

Abstract:
A pair of vertices u, v is said to be strongly resolved by a vertex s, if there exist at least one shortest path from s to u passing through v, or a shortest path from s to v passing through u. A set W⊆V, is said to be a strong metric generator if for all pairs u, v ∈/ W, there exist some element s ∈ W such that s strongly resolves the pair u, v. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. The strong met-ric dimension metric dimension problem is to find a min-imum strong metric basis metric basis in the graph.


Keywords Strong metric basis; strong metric dimension; circulant graphs; hypercubes; diametrically uniform graphs


  • BibTex
  • Reference
  • XML
  • JSON
  • Dublin Core
  • CSL

@article{OnS1482011, author = {Cyriac Grigorious,Sudeep Stephen,Albert William}, title = {On Strong Metric Dimension Of Diametrically Ver-tex Uniform Graphs}, journal={International Journal of Computing Algorithm}, volume={3}, issue={2}, issn = {2278-2397}, year = {2014}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1]. G Chartrand, L. Eroh, M. Johnson, O. Oellermann, Resolvability in graphs and the metric dimension of a graph, Discrete Appl. Math. 105 2000, no. 1-3, 99-113.
  • [2]. arary,F., Melter, R. A.: On the metric dimension of a graph. The-ory of Computing Systems, Ars Com-binatoria, 2 191-195 1976
  • [3]. Slater, P. J.: Leaves of trees. Proc. 6th Southeastern Conference on Com- binatorics, Graph Theory, and Computing, Congressus Nu-merantium, 14, 549-559 1975
  • [4]. S. Yushmanov, Estimates for the metric dimension of a graph in terms of the diameters and the number of vertices, Vestnik Moskov. Univ. Ser. I Mat. Mekh. 103 1987 no. 1, 68-70.
  • [5]. R.A Melter, I. Tomescu, Metric bases in digital geometry, Com-puter Vision, Graphics, and Image Processing 25 1984 113-121.
  • [6]. S. Khuller,B. Ragavachari, A. Rosenfeld, Landmarks in graphs, Dis-crete Applied Mathematics 70 1996 217-229.
  • [7]. P. Manuel, R. Bharati, I. Rajasingh, C. Monica, Landmarks in torus networks, Journal of Discrete Mathematical Sciences Cryp-tography 9 2 2006 263-271.
  • [8]. M.A. Johnson, Structure-activity maps for visualizing the graph vari- ables arising in drug design, Journal of Biopharmaceutical Sta-tistics 3 1993 203-236.
  • [9]. Caceres, J., Hernando, C., Mora, M., Pelayo I. M., Puertas, M. L., Seara, C.: On the metric dimension of some families of graphs. Elec-tronic Notes in Discrete Mathematics, 22, 129-133 2005
  • [10]. Hulme, B. L., Shiver, A. W., Slater, P. J.: A Boolean algebraic analysis of fire protection. Algebraic and Combinatorial Methods in Operations Research, 95, 215-227 1984
  • [11]. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP Completeness, W.H. Freeman and Company, 1979.
  • [12]. Paul Manuel, Mostafa Abd-El-Barr, Indra Rajasingh and Bharati Ra- jan, An Efficient Representation of Benes Networks and its Appli-cations, Journal of Discrete Algorithm 6 2008 11-19
  • [13]. M. Paul, R. Bharati, R. Indra, M. Chris, On Minimum Metric Dimen-sion of Honeycomb Networks, Journal of Discrete Algorithms, 6 2008 20-27.
  • [14]. M. Paul, R. Bharati, R. Indra, M. M. Chris Monica, Landmarks in binary tree derived architectures, Ars Combinatoria, 99 2011 473-486.
  • [15]. Saenpholphat, V., Zhang, P: Conditional resolvability in graphs: a sur- vey. International Journal of Mathematics and Mathematical Sciences, 38, 1997-2017 2004

  • <?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2014</publicationDate> <volume>3</volume> <issue>2</issue> <startPage>114</startPage> <endPage>116</endPage> <documentType>article</documentType> <title language='eng'>On Strong Metric Dimension Of Diametrically Ver-tex Uniform Graphs</title> <authors> <author> <name>Cyriac Grigorious</name> </author> </authors> <abstract language='eng'>A pair of vertices u, v is said to be strongly resolved by a vertex s, if there exist at least one shortest path from s to u passing through v, or a shortest path from s to v passing through u. A set W⊆V, is said to be a strong metric generator if for all pairs u, v ∈/ W, there exist some element s ∈ W such that s strongly resolves the pair u, v. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. The strong met-ric dimension metric dimension problem is to find a min-imum strong metric basis metric basis in the graph.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p820.pdf</fullTextUrl> <keywords language='eng'> <keyword>Strong metric basis; strong metric dimension; circulant graphs; hypercubes; diametrically uniform graphs</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=820", "name":"On Strong Metric Dimension Of Diametrically Ver-tex Uniform Graphs", "author":[{"name":"Cyriac Grigorious "}], "datePublished":"2014", "description":"A pair of vertices u, v is said to be strongly resolved by a vertex s, if there exist at least one shortest path from s to u passing through v, or a shortest path from s to v passing through u. A set W⊆V, is said to be a strong metric generator if for all pairs u, v ∈/ W, there exist some element s ∈ W such that s strongly resolves the pair u, v. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. The strong met-ric dimension metric dimension problem is to find a min-imum strong metric basis metric basis in the graph.", "keywords":["Strong metric basis; strong metric dimension; circulant graphs; hypercubes; diametrically uniform graphs"], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

    <?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>Sudeep Stephen</dc:contributor> <dc:contributor>Albert William</dc:contributor> <dc:contributor></dc:contributor> <dc:creator>Cyriac Grigorious</dc:creator> <dc:date>2014</dc:date> <dc:description>A pair of vertices u, v is said to be strongly resolved by a vertex s, if there exist at least one shortest path from s to u passing through v, or a shortest path from s to v passing through u. A set W⊆V, is said to be a strong metric generator if for all pairs u, v ∈/ W, there exist some element s ∈ W such that s strongly resolves the pair u, v. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. The strong met-ric dimension metric dimension problem is to find a min-imum strong metric basis metric basis in the graph.</dc:description> <dc:identifier>2014SCIA316F0820</dc:identifier> <dc:language>eng</dc:language> <dc:title>On Strong Metric Dimension Of Diametrically Ver-tex Uniform Graphs</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2014SCIA316F0820", "abstract": "A pair of vertices u, v is said to be strongly resolved by a vertex s, if there exist at least one shortest path from s to u passing through v, or a shortest path from s to v passing through u. A set W⊆V, is said to be a strong metric generator if for all pairs u, v ∈/ W, there exist some element s ∈ W such that s strongly resolves the pair u, v. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. The strong met-ric dimension metric dimension problem is to find a min-imum strong metric basis metric basis in the graph.", "author": [ { "family": "Cyriac Grigorious,Sudeep Stephen,Albert William" } ], "id": "820", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " On Strong Metric Dimension Of Diametrically Ver-tex Uniform Graphs", "type": "publication-article", "version": "3" }