Name
Abstract | ||
|---|---|---|
In 2009, Akelbek and Kirkland introduced a useful parameter called the scrambling index of a primitive digraph D, which is the smallest positive integer k such that for every pair of vertices u and v, there is a vertex w such that we can get to w from u and v in D by walks of length k. In this paper, we study and obtain the scrambling indices of all primitive digraphs with exactly two cycles. |
Year | DOI | Venue |
|---|---|---|
2013 | null | ARS COMBINATORIA |
Keywords | Field | DocType |
Primitive digraph,scrambling index,cycle | Discrete mathematics,Combinatorics,Scrambling,Mathematics | Journal |
Volume | Issue | ISSN |
108 | null | 0381-7032 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu-Bin Gao | 1 | 6 | 7.70 |
| Yanling Shao | 2 | 4 | 4.96 |