Exponent and Scrambling Index of Some Composite Graphs

Linna Syahputri; Saib Suwilo; Mardiningsih Mardiningsih

doi:10.30829/zero.v10i1.28727

Exponent and Scrambling Index of Some Composite Graphs

Linna Syahputri, Saib Suwilo, Mardiningsih Mardiningsih

Abstract

A connected graphs G is primitive provided there is a positive integer k such that for each pair of vertices u and v in G there exists a uv-walk of length k. The scrambling index of a primitive graph G, , is the smallest positive integer k such that for each two vertices u and v there is a vertex w with the property that there exist a uw-walk and a vw-walk of length k. We discuss the scrambling index of the joint and the corona product of two vertex disjoint graphs. For such graphs, we discuss their primtivity and then we present their scrambling index.

Keywords

Composite Graphs; Exponent; Scrambling Index.

Full Text:

PDF

References

REFERENCES

R. A. Brualdi and H. J. Ryser, Combinatorial Matrix Theory. Cambridge, U.K.: Cambridge Univ. Press, 1991.

M. Akelbek and S. Kirkland, “Coefficients of ergodicity and the scrambling index,” Linear Algebra Appl., vol. 430, no. 4, pp. 1111–1130, 2009, doi: https://doi.org/10.1016/j.laa.2008.10.007.

M. Akelbek and S. Kirkland, “Primitive digraphs with the largest scrambling index,” Linear Algebra Appl., vol. 430, no. 4, pp. 1099–1110, 2009, doi: https://doi.org/10.1016/j.laa.2008.10.006.

S. Chen and B. Liu, “The scrambling index of symmetric primitive matrices,” Linear Algebra Appl., vol. 433, pp. 1110–1126, Apr. 2010, doi: 10.1016/j.laa.2009.12.028.

Y.-N. Yeh and I. Gutman, “On the sum of all distances in composite graphs,” Discrete Math., vol. 135, no. 1, pp. 359–365, 1994, doi: https://doi.org/10.1016/0012-365X(93)E0092-I.

R. Hammack and W. Imrich and S. Klavzar, Handbook of Product Graphs. CRC Press, 2011.

DOI: http://dx.doi.org/10.30829/zero.v10i1.28727