Scribd Logo
Carica

Benvenuto in Scribd!

  • Cyclic Resolving Number of Grid and Augmented Grid Graphs

    Caricato da

    International Journal of Computing Algorithm
    1 visualizzazioni1 pagina
    For an ordered set W = {w1, w2 … wk}  V (G) of vertices, we refer to the ordered k-tuple r(v  W) = (d(v, w1), d(v, w2) … d(v, wk)) as the (metric) representation of v with respect to W. A set W of a connected graph G is called a resolving set of G if distinct vertices of G have distinct representations with respect to W. A resolving set with minimum cardinality is called a minimum resolving set or a basis. The dimension, dim(G), is the number of vertices in a basis for G. By imposing additional constraints on the resolving set, many resolving parameters are formed. In this paper, we introduce cyclic resolving set and find the cyclic resolving number for a grid graph and augmented grid graph.

    Copyright

    © © All Rights Reserved

    Formati disponibili

    PDF, TXT o leggi online da Scribd

    Hai trovato utile questo documento?

    Questo contenuto è inappropriato?

    Segnala questo documento
    For an ordered set W = {w1, w2 … wk}  V (G) of vertices, we refer to the ordered k-tuple r(v  W) = (d(v, w1), d(v, w2) … d(v, wk)) as the (metric) representation of v with respect to W. A set W of a connected graph G is called a resolving set of G if distinct vertices of G have distinct representations with respect to W. A resolving set with minimum cardinality is called a minimum resolving set or a basis. The dimension, dim(G), is the number of vertices in a basis for G. By imposing additional constraints on the resolving set, many resolving parameters are formed. In this paper, we introduce cyclic resolving set and find the cyclic resolving number for a grid graph and augmented grid graph.

    Copyright:

    © All Rights Reserved
    Scarica in formato PDF, TXT o leggi online su Scribd
    Segnala contenuti inappropriati
    1 visualizzazioni1 pagina

    Cyclic Resolving Number of Grid and Augmented Grid Graphs

    Caricato da

    International Journal of Computing Algorithm
    For an ordered set W = {w1, w2 … wk}  V (G) of vertices, we refer to the ordered k-tuple r(v  W) = (d(v, w1), d(v, w2) … d(v, wk)) as the (metric) representation of v with respect to W. A set W of a connected graph G is called a resolving set of G if distinct vertices of G have distinct representations with respect to W. A resolving set with minimum cardinality is called a minimum resolving set or a basis. The dimension, dim(G), is the number of vertices in a basis for G. By imposing additional constraints on the resolving set, many resolving parameters are formed. In this paper, we introduce cyclic resolving set and find the cyclic resolving number for a grid graph and augmented grid graph.

    Copyright:

    © All Rights Reserved
    Scarica in formato PDF, TXT o leggi online su Scribd
    Segnala contenuti inappropriati
    di 1

    International Journal of Computing Algorithm, Vol 2(2), December 2013

    ISSN(Print):2278-2397

    Cyclic Resolving Number of Grid and Augmented


    Grid Graphs
    M.Chris Monica1, D.Little Femilin Jana 2
    1

    Department of Mathematics, Loyola College, Chennai


    Department of Mathematics, Prince Shri Venkateshwara Padmavathy Engineering College, Chennai
    Email: chrismonicam@yahoo.com

    Abstract
    For an ordered set W = {w1, w2 wk} V (G) of vertices, we refer to the ordered k-tuple
    r(v W) = (d(v, w1), d(v, w2) d(v, wk)) as the (metric) representation of v with respect to
    W. A set W of a connected graph G is called a resolving set of G if distinct vertices of G have
    distinct representations with respect to W. A resolving set with minimum cardinality is called
    a minimum resolving set or a basis. The dimension, dim(G), is the number of vertices in a
    basis for G. By imposing additional constraints on the resolving set, many resolving
    parameters are formed. In this paper, we introduce cyclic resolving set and find the cyclic
    resolving number for a grid graph and augmented grid graph.

    Website: www.ijcoa.com

    Potrebbero piacerti anche