Scrambling index of certain primitive graphs consisting of two disjoint odd cycles connected by some paths

4th International Conference on Operational Research

Sitorus, Mariana^1 ; Ginting, Febryandi^1 ; Nasution, Putri K.^1 ; Atikah, Sundari^1

Department of Mathematics, Universitas Sumatera Utara, Medan, Indonesia^1

关键词: Graph G;    Odd cycle;    Positive integers;    Scrambling indices;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/300/1/012077/pdf
DOI  :  10.1088/1757-899X/300/1/012077

来源: IOP

【 摘 要 】

The scrambling index of a primitive graph G is the smallest positive integer k such that for each pair of vertices u and v there is a vertex w such that there exists a uw-walk and a vw-walk of length k. We discuss the scrambling index of primitive graphs G consisting of two disjoint odd cycles each of length s connected by some paths of length 0. For such primitive graphs G we present formulae for scrambling indices that depend on s and 0.