Study of graph isomorphism using Jordan forms of adjacency matrices
From MaRDI portal
Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Diagonalization, Jordan forms (15A20) Canonical forms, reductions, classification (15A21)
Recommendations
Cites work
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Frequency Analysis
- Engineering an efficient canonical labeling tool for large and sparse graphs
- Graph isomorphism in quasipolynomial time (extended abstract)
- scientific article; zbMATH DE number 3843914 (Why is no real title available?)
- scientific article; zbMATH DE number 4214203 (Why is no real title available?)
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3320800 (Why is no real title available?)
- Networks. An introduction.
- The Jordan canonical form for a class of weighted directed graphs
- The Jordan canonical form for a class of zero-one matrices
- Uncertainty Principles and Sparse Eigenvectors of Graphs
Cited in
(3)
This page was built for publication: Study of graph isomorphism using Jordan forms of adjacency matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151220)