Spectra and elementary cycles of the digraphs with unique paths of fixed length

DOI10.1016/S0024-3795(99)00028-2MaRDI QIDQ1963932zbMATH OpenOpenAlexWikidataFDO

Authors Yaokun Wu, Qiao Li, Jingjie Li

Publication date 26 November 2000

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0024-3795(99)00028-2

zbMATH Keywords

adjacency matrixdigraphelementary cyclesspectraunique paths

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

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.

Recommendations

• scientific article; zbMATH DE number 5524702
• Circulant digraphs determined by their spectra
• scientific article; zbMATH DE number 1193017
• The Spectra of Cycle Prefix Digraphs
• On digraphs with circulant adjacent matrices

Cited in

(5)

• An approach to solving \(A^{k}=J-I\)
• A class of digraphs which have completely real Laplacian spectra
• scientific article; zbMATH DE number 1193017 (Why is no real title available?)
• Graphs with the unique path property: Structure, cycles, factors, and constructions
• Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs

This page was built for publication: Spectra and elementary cycles of the digraphs with unique paths of fixed length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963932)