The underlying line digraph structure of some (0, 1)-matrix equations

DOI10.1016/S0166-218X(01)00186-XzbMath0995.05097MaRDI QIDQ5957359

Joan Gimbert, Yaokun Wu

Publication date: 23 May 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

line digraphMoore bound\((0,1)\)-matrix

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs ⋮ The spectra of subKautz and cyclic Kautz digraphs ⋮ Zero forcing in iterated line digraphs ⋮ On Moore bipartite digraphs ⋮ On the weak distance-regularity of Moore-type digraphs

Cites Work

• On the connectivity of cages with girth five, six and eight
• On the matrix equation \(A^k=J-I\)
• Directed graphs with unique paths of fixed length
• On the impossibility of directed Moore graphs
• On the matrix equation \(A^l+A^{l+k}=J_n\)
• \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)
• Line Digraph Iterations and the (d, k) Digraph Problem
• A Design for Directed Graphs with Minimum Diameter
• The Spectra of Cycle Prefix Digraphs
• The Polynomial of a Directed Graph
• Notes on central groupoids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The underlying line digraph structure of some (0, 1)-matrix equations