Spectra and elementary cycles of the digraphs with unique paths of fixed length
type: Item
instance of: scholarly article
title: Spectra and elementary cycles of the digraphs with unique paths of fixed length
zbMATH Open document ID: 0956.05069
DOI: 10.1016/S0024-3795(99)00028-2
author: Yaokun Wu
author: Qiao Li
author: Jingjie Li
published in: Linear Algebra and its Applications
publication date: 2000-11-26T00:00:00Z
review text: A digraph \(G\), whose adjacency matrix \(A\) satisfies \(A^k= J_n- I_n\), where \(J_n\) is the \(n\times n\) matrix of all ones, is called a digraph with unique paths of fixed length \(k\), shortly UPFL-\(k\) digraph. The authors prove that the UPFL-\(k\) digraphs of the ame order are cospectral and have the same number of elementary cycles of length \(l\) for each \(l\leq k\). This result is a serious generalization of a previous result. The authors also give interesting computational approaches useful in this area.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1398466
zbMATH Keywords: spectra
zbMATH Keywords: digraph
zbMATH Keywords: adjacency matrix
zbMATH Keywords: unique paths
zbMATH Keywords: elementary cycles
reviewed by: Ferdinand Gliviak
MaRDI profile type: Publication
full work available at URL: s0024-3795(99)00028-2
OpenAlex ID: W2159787906
Wikidata QID: Q126470156
description: scientific article; zbMATH DE number 1398466