Back to Search
Start Over
Imprimitivity index of the adjacency matrix of digraphs.
- Source :
-
Linear Algebra & its Applications . Mar2017, Vol. 517, p1-10. 10p. - Publication Year :
- 2017
-
Abstract
- Let G be a graph. An edge orientation of G is called smooth if the in-degree and the out-degree of every vertex differ by at most one. In this paper, we show that if G is a 2-edge-connected non-bipartite graph with δ ( G ) ≥ 3 , then G has a smooth primitive orientation. Among other results, using the spectral radius of digraphs, we show that if D 1 is a primitive regular orientation and D 2 is a non-regular orientation of a given graph, then for sufficiently large t , the number of closed walks of length t in D 1 is more than the number of closed walks of length t in D 2 . [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 517
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 120589671
- Full Text :
- https://doi.org/10.1016/j.laa.2016.12.004