On k-primitivity of two classes of digraphs
โ Scribed by Yubin Gao; Yanling Shao
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 112 KB
- Volume
- 430
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In the paper we present two characterizations of classes of digraphs. The first is a forbidden triple characterization of digraphs with augmented adjacency matrices having consecutive ones property for columns. The second is a forbidden circuit characterization of digraphs with totally balanced augm
A digraph G = (V, E) is primitive i[~ for some positive integer k, there is a u ~ ~; walk of length k for evew pair u, v of vertices of V. The minimum such k is called the exponent of G, denoted exp(G). The local exponent of G at a vertex u ~ V, denoted expc(u), is the least integer k such that ther