Back to Search
Start Over
On the characterization of digraphs with given rank.
- Source :
-
Linear Algebra & its Applications . Feb2020, Vol. 587, p215-227. 13p. - Publication Year :
- 2020
-
Abstract
- The rank of a digraph is defined as the rank of its adjacency matrix. In this paper we show how to find all digraphs of rank k from the reduced bipartite graphs of rank 2 k. In particular, since the bipartite graphs of rank 2 , 4 and 6 are known, then we characterize digraphs of rank 1 , 2 and 3. The results are based on rank-preserving operations on digraphs such as splitting and fusion of vertices or twin-deletion and vertex-multiplication. [ABSTRACT FROM AUTHOR]
- Subjects :
- *BIPARTITE graphs
*RANKING
Subjects
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 587
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 140334330
- Full Text :
- https://doi.org/10.1016/j.laa.2019.11.008