The following pages link to Constructing cospectral graphs (Q595685):
Displaying 33 items.
- Constructing cospectral signed graphs (Q4959338) (← links)
- A Unified Framework for Structured Graph Learning via Spectral Constraints (Q4969059) (← links)
- Constructing families of cospectral regular graphs (Q4987254) (← links)
- Spectra of M-rooted product of graphs (Q5023592) (← links)
- On the construction of cospectral graphs for the adjacency and the normalized Laplacian matrices (Q5043679) (← links)
- Aα spectra of graphs obtained by two corona operations and Aα cospectral graphs (Q5063295) (← links)
- Spectra of bowtie product of graphs (Q5063297) (← links)
- Random quantum graphs (Q5067609) (← links)
- Constructions of cospectral graphs with different zero forcing numbers (Q5078599) (← links)
- Constructing isospectral non‐isomorphic digraphs from hypergraphs (Q5190333) (← links)
- (Q5218271) (← links)
- Edge switching transformations of quantum graphs—a scattering approach (Q5743361) (← links)
- GRAPHS DETERMINED BY THEIR -GAIN SPECTRA (Q5857586) (← links)
- Switching for Small Strongly Regular Graphs (Q5869433) (← links)
- (Q5869453) (← links)
- On adjacency and Laplacian cospectral non-isomorphic signed graphs (Q5881016) (← links)
- Cospectral mates for generalized Johnson and Grassmann graphs (Q6083980) (← links)
- The spectrum and metric dimension of Indu–Bala product of graphs (Q6115741) (← links)
- The strongly regular twisted \(D_{5 , 5} ( q )\) graph (Q6130229) (← links)
- An explicit formula for the distance characteristic polynomial of threshold graphs (Q6159856) (← links)
- Finding singularly cospectral graphs (Q6160513) (← links)
- Laplacian eigenvalues of equivalent cographs (Q6160542) (← links)
- Spectral theory of the non-backtracking Laplacian for graphs (Q6172286) (← links)
- A geometric construction of isospectral magnetic graphs (Q6172799) (← links)
- Differentiate data by higher-order structures (Q6192296) (← links)
- A switching method for constructing cospectral gain graphs (Q6197703) (← links)
- An improved condition for a family of trees being determined by their generalized spectrum (Q6494935) (← links)
- A note on graphs with purely imaginary per-spectrum (Q6571006) (← links)
- Construction of cospectral graphs, signed graphs and \(\mathbb{T}\)-gain graphs via partial transpose (Q6604503) (← links)
- Constructing cospectral graphs by unfolding non-bipartite graphs (Q6611026) (← links)
- Integral trees with diameter 6 (Q6611054) (← links)
- Distance Laplacian spectra of graphs: a survey (Q6657228) (← links)
- Spectra of variants of distance matrices of graphs and digraphs: a survey (Q6664411) (← links)
