An approach to solving A^k=J-I

DOI10.1016/S0024-3795(02)00669-9zbMATH Open1032.15011MaRDI QIDQ1414133FDOQ1414133

Authors: Yaokun Wu, Qiao Li 

Publication date: 19 November 2003

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

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

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)

Cites Work

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

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)