An approach to solving A^k=J-I

DOI10.1016/S0024-3795(02)00669-9MaRDI QIDQ1414133zbMATH OpenFDO

Authors Yaokun Wu, Qiao Li

Publication date 19 November 2003

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

Full work available at URL https://doi.org/10.1016/S0024-3795(02)00669-9

zbMATH Keywords

digraphsintersection graphmatrix equationEuler's totient functionpartitionable graphcycle powersgeneralized circulantnear-\(k\)-factor factorizationrow set

Mathematics Subject Classification ID

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

Recommendations

• On the matrix equation \(A^k=J-I\)
• scientific article; zbMATH DE number 4055787
• On the matrix equation \(A^l+A^{l+k}=J_n\)
• scientific article; zbMATH DE number 13201
• scientific article; zbMATH DE number 799985

Cites work

• scientific article; zbMATH DE number 1577983 (Why is no real title available?)
• scientific article; zbMATH DE number 3650737 (Why is no real title available?)
• scientific article; zbMATH DE number 3884202 (Why is no real title available?)
• scientific article; zbMATH DE number 3851153 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4148118 (Why is no real title available?)
• scientific article; zbMATH DE number 4163144 (Why is no real title available?)
• scientific article; zbMATH DE number 4055787 (Why is no real title available?)
• scientific article; zbMATH DE number 1193017 (Why is no real title available?)
• scientific article; zbMATH DE number 3763984 (Why is no real title available?)
• scientific article; zbMATH DE number 1286503 (Why is no real title available?)
• scientific article; zbMATH DE number 1455118 (Why is no real title available?)
• scientific article; zbMATH DE number 3432293 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• An Introduction to Symbolic Dynamics and Coding
• Circular representation problem on hypergraphs
• Coloring a Family of Circular Arcs
• Combinatorial Configurations
• Combinatorial designs and related systems
• Combinatorial designs related to the strong perfect graph conjecture
• Combinatorial matrix theory
• Combinatorial optimization. Packing and covering
• Cutsets in perfect and minimal imperfect graphs
• Directed graphs with unique paths of fixed length
• Graph Classes: A Survey
• Graphical properties related to minimal imperfection
• On circular critical graphs
• On stable set polyhedra for K//(1,3)free graphs
• On the matrix equation \(A^k=J-I\)
• On the matrix equation \(A^l+A^{l+k}=J_n\)
• On the strong perfect graph conjecture
• Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
• Perfect graphs, partitionable graphs and cutsets
• Perfect zero–one matrices
• Some aspects of minimal imperfect graphs
• Spectra and elementary cycles of the digraphs with unique paths of fixed length
• Star-cutsets and perfect graphs
• The Hamiltonian property of consecutive-\(d\) digraphs
• The Polynomial of a Directed Graph
• The Strong Perfect Graph Conjecture for Planar Graphs
• The connectivity of minimal imperfect graphs
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Topics in Intersection Graph Theory
• \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\)

Cited in

(4)

• Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
• Exponent-critical primitive graphs and the Kronecker product
• Incomplete Methods for Solving A^T Ax = b
• Efficient solution of \(A x^{(k)}= b^{(k)}\) using \(A^{ - 1}\)

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

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