scientific article; zbMATH DE number 3411062
From MaRDI portal
Publication:5676231
Cited in
(only showing first 100 items - show all)- On the asymptotic behavior of graphs determined by their generalized spectra
- Branching in graphs and molecules
- Constructing trees with given eigenvalues and angles
- Permanental polynomials of graphs
- The symbiotic relationship of combinatorics and matrix theory
- The distribution of degrees in a large random tree
- An introduction to matching polynomials
- Spectra of Cayley graphs
- A linear algorithm for disjoint matchings in trees
- Distance matrix polynomials of trees
- On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs
- Construction of graphs with special properties
- Laplacian matrices of graphs: A survey
- Which graphs are determined by their spectrum?
- Reconstruction of weighted graphs by their spectrum
- No threshold graphs are cospectral
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- Research problems from the 19th British Combinatorial Conference
- Extremal f-trees and embedding spaces for molecular graphs
- Graphs determined by polynomial invariants
- Laplacian spectra and spanning trees of threshold graphs
- The enumeration of trees with and without given limbs
- The isomorphism problem of trees from the viewpoint of Terwilliger algebras
- Some spectral properties of the non-backtracking matrix of a graph
- Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
- On conjectures of network distance measures by using graph spectra
- On the spectral characterization of the \(p\)-sun and the \((p, Q)\)-double sun
- Constructing cospectral graphs via regular rational orthogonal matrices with level two
- On a conjecture about the spectral radius of block graphs
- Spectral determination of graphs with one positive anti-adjacency eigenvalue
- On the construction of cospectral nonisomorphic bipartite graphs
- Spectra of weighted uniform hypertrees
- On Hosoya's dormants and sprouts
- On cospectrality of gain graphs
- Holes in lace doilies: the geometric kernel of circulant graphs
- The Braess' paradox for pendent twins
- Zeta-equivalent digraphs: simultaneous cospectrality
- Construction of cospectral graphs
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs
- Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations
- A large family of cospectral Cayley graphs over dicyclic groups
- Cospectral constructions for several graph matrices using cousin vertices
- Coined quantum walks lift the cospectrality of graphs and trees
- Cospectrality of graphs with respect to distance matrices
- Determining graphs by the complementary spectrum
- Generalized cospectral graphs with and without Hamiltonian cycles
- Distinguishing graphs with zeta functions and generalized spectra
- Exponentially many graphs have a \(Q\)-cospectral mate
- On the spectral characterization of T-shape trees
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- Enumeration of cubic Cayley graphs on dihedral groups
- The spectra of uniform hypertrees
- Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
- Two new topological indices based on graph adjacency matrix eigenvalues and eigenvectors
- A sufficient condition for a family of graphs being determined by their generalized spectra
- On the eigenvalues of eccentricity matrix of graphs
- Spectral determinations and eccentricity matrix of graphs
- Spectral properties of the exponential distance matrix
- On graphs with exactly one anti-adjacency eigenvalue and beyond
- On the Characteristic Equations of the Characteristic Polynomial
- Domination and spectral graph theory
- A simple arithmetic criterion for graphs being determined by their generalized spectra
- Two Laplacians for the distance matrix of a graph
- Constructing cospectral graphs via a new form of graph product
- \(\mathcal Q\)-cospectrality and \(\mathcal L\)-energy in cographs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- The Laplacian permanental polynomial for trees
- Indistinguishable trees and graphs
- Constructing cospectral signed graphs
- On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices
- A relation on trees and the topological indices based on subgraph
- scientific article; zbMATH DE number 7583268 (Why is no real title available?)
- A large family of cospectral Cayley graphs over dihedral groups
- On the spectral determinations of the connected multicone graphs \(K_r \nabla sK_t\)
- A note on non-\(\mathbb{R}\)-cospectral graphs
- Two-color Soergel calculus and simple transitive 2-representations
- Algebraic combinatorics on trace monoids: extending number theory to walks on graphs
- Spectra of coronae
- Graphs determined by their \(T\)-gain spectra
- Complementarity eigenvalues and graph determination
- Strong Cospectrality and Twin Vertices in Weighted Graphs
- Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph
- Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
- Strong cospectrality in trees
- Spectral radii of friendship graphs and their connected induced subgraphs
- Graphs sharing an arbitrary number of ordered complementarity eigenvalues
- An explicit formula for the distance characteristic polynomial of threshold graphs
- Finding singularly cospectral graphs
- Laplacian eigenvalues of equivalent cographs
- New results on complementarity spectra of connected graphs
- On the divisibility of H-shape trees and their spectral determination
- Spectral theory of the non-backtracking Laplacian for graphs
- Strongly cospectral vertices
- On the distribution of eigenvalues of increasing trees
- Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs
- Distinguishing graphs by their left and right homomorphism profiles
- An improved condition for a family of trees being determined by their generalized spectrum
- The diameter and eccentricity eigenvalues of graphs
- Eigen-persistence in graphs
- Spectral faux trees
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 Q5676231)