Primary decomposition theorem and generalized spectral characterization of graphs
From MaRDI portal
Cites work
- \(p\)-adic numbers. An introduction
- A new criterion for oriented graphs to be determined by their generalized skew spectrum
- A note on cospectral graphs
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- A sufficient condition for a family of graphs being determined by their generalized spectra
- An improved condition for a graph to be determined by its generalized spectrum
- Controllable subsets in graphs
- Generalized spectral characterization of graphs revisited
- Generalized spectral characterization of signed trees
- Generalized spectral characterizations of a new family of noncontrollable graphs
- Generalized spectral characterizations of almost controllable graphs
- Haemers’ Conjecture: An Algorithmic Perspective
- scientific article; zbMATH DE number 3336895 (Why is no real title available?)
- Mixed graphs determined by their generalized Hermitian adjacency spectrum based on Eisenstein integers
- Modern computer algebra
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- On the generalized A_-spectral characterizations of almost -controllable graphs
- Proof of a conjecture on the determinant of the walk matrix of rooted product with a path
- Smith normal form and the generalized spectral characterization of graphs
Cited in
(2)
This page was built for publication: Primary decomposition theorem and generalized spectral characterization of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939599)