An approach to solving \(A^{k}=J-I\)

DOI10.1016/S0024-3795(02)00669-9zbMath1032.15011MaRDI QIDQ1414133

Qiao Li, Yaokun Wu

Publication date: 19 November 2003

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

zbMATH Keywords

intersection graphdigraphsmatrix equationpartitionable graphEuler's totient functioncycle powersgeneralized circulantnear-\(k\)-factor factorizationrow set

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs ⋮ Exponent-critical primitive graphs and the Kronecker product

Cites Work

• Perfect graphs, partitionable graphs and cutsets
• On circular critical graphs
• Circular representation problem on hypergraphs
• Star-cutsets and perfect graphs
• On the matrix equation \(A^k=J-I\)
• Graphical properties related to minimal imperfection
• On stable set polyhedra for K//(1,3)free graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Directed graphs with unique paths of fixed length
• Combinatorial designs related to the strong perfect graph conjecture
• On the matrix equation \(A^l+A^{l+k}=J_n\)
• The Hamiltonian property of consecutive-\(d\) digraphs
• \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)
• Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
• Spectra and elementary cycles of the digraphs with unique paths of fixed length
• Combinatorial designs and related systems
• Combinatorial Optimization
• Coloring a Family of Circular Arcs
• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Perfect zero–one matrices
• An Introduction to Symbolic Dynamics and Coding
• The connectivity of minimal imperfect graphs
• The Polynomial of a Directed Graph
• Combinatorial Configurations
• The Strong Perfect Graph Conjecture for Planar Graphs
• On the strong perfect graph conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approach to solving \(A^{k}=J-I\)