Scrambling Index dari Graf Terdiri Atas Dua Cycle Ganjil yang dihubungkan oleh Beberapa Lintasan

Abstract

The scrambling index of a primitive graph G is the smallest positive integer k such that for each pair of vertices u dan v there is a vertex w that we can get to w from u and v in G by walks of lenght k. We discuss the scrambling index of primitive graph G consisting of two disjoint odd cycles each of length sconnected by some paths of length `. For such primitive graphs G we present formulae for scrambling index that depend on s and `.