scientific article; zbMATH DE number 3224340
From MaRDI portal
Publication:5512801
Cited in
(21)- Computing the characteristic polynomial of a tree
- On the minors of an incidence matrix and Smith normal form
- On the Laplacian spectrum of (\(\alpha,\omega\))-graphs
- A Harary-Sachs theorem for hypergraphs
- Applications of the Harary-Sachs theorem for hypergraphs
- Invariant subspace, determinant and characteristic polynomials
- Antipodal covering graphs
- On eigenspaces of some compound signed graphs
- Estimation of means in graphical Gaussian models with symmetries
- Perfect colorings of regular graphs
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Gröbner bases, symmetric matrices, and type C Kazhdan–Lusztig varieties
- An equitable partition based construction of graphs with the same spectral radius
- New families of trees determined by their spectra
- Perfect colourings of simplices and hypercubes in dimension four and five with few colours
- Equitable partitions and spectra of symmetric trees: revisiting Heilbronner's composition principle
- New results on the adjugate matrix applied to graphs with a rotated edge
- Laplacian eigenvectors and eigenvalues and almost equitable partitions
- Characteristic polynomials of ramified uniform covering digraphs
- Spectral results on graphs with regularity constraints
- Spectral results on regular graphs with (k,)-regular sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5512801)
