:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Friesen, Ori, Kolko, Cecily, Layman, Nick, Lorenzen, Kate, Zaske, Sarah, Zeigler, Amy
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2412.05389
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Coalescing sets preserving cospectrality of graphs arising from block similarity matrices
by: Mahamud, Sajid Bin, et al.
Published: (2024)

On the construction of cospectral nonisomorphic bipartite graphs
by: Kannan, M. Rajesh, et al.
Published: (2021)

The Distinguishing Index of Mycielskian Graphs
by: Kennedy, Rowan, et al.
Published: (2024)

A general switching method for constructing E-cospectral hypergraphs
by: Abiad, Aida, et al.
Published: (2026)

Switching methods of level 2 for the construction of cospectral graphs
by: Abiad, Aida, et al.
Published: (2024)

On cospectral graphons
by: Hladký, Jan, et al.
Published: (2024)

The graphs which are cospectral with the generalized pineapple graph
by: Li, Borchen, et al.
Published: (2023)

Logical aspects of isomorphism of controllable graphs and cospectrality of distance-regularized graphs
by: Abiad, Aida, et al.
Published: (2026)

Defective eigenvalues of the non-backtracking matrix
by: Heysse, Kristin, et al.
Published: (2024)

Constructing cospectral hypergraphs
by: Abiad, Aida, et al.
Published: (2022)

On the number of generalized cospectral mates of graphs
by: Raza, Muhammad, et al.
Published: (2026)

On the levels of rational regular orthogonal matrices for generalized cospectral graphs
by: Wang, Wei, et al.
Published: (2026)

A characterization of generalized cospectrality of rooted graphs with applications in graph reconstruction
by: Wang, Wei, et al.
Published: (2024)

Counting cospectral graphs obtained via switching
by: Abiad, Aida, et al.
Published: (2025)

Constructing cospectral graphs via regular rational orthogonal matrix with level two and three
by: Mao, Lihuan, et al.
Published: (2024)

New arithmetic invariants for cospectral graphs
by: Ji, Yizhe, et al.
Published: (2024)

Degree-similar graphs and cospectral graphs
by: Fan, Yi-Zheng, et al.
Published: (2025)

Constructions of $A_α$-cospectral graphs using some corona operations
by: K, Najiya V, et al.
Published: (2024)

Which $L$-cospectral graphs have same degree sequences
by: Ye, Jiachang
Published: (2024)

Constructing cospectral graphs by unfolding non-bipartite graphs
by: Kannan, M. Rajesh, et al.
Published: (2024)

Almost all cographs have a cospectral mate
by: Wang, Wei, et al.
Published: (2025)

Singularly cospectral circulant graphs
by: Conde, Cristian M., et al.
Published: (2024)

A characterization of all graphs cospectral to the double star $P_2(1,n)$
by: Barranca, Emily, et al.
Published: (2025)

Construction of non-regular $A_α$-cospectral graphs from some join of graphs
by: K, Najiya V, et al.
Published: (2022)

Decompositions of some classes of regular graphs into cycles and paths of length eight
by: C, Cecily Sahai., et al.
Published: (2023)

Spectral multiplicity functions of adjacency operators of graphs and cospectral infinite graphs
by: de la Harpe, Pierre
Published: (2023)

Two Laplacians for the resistance distance matrix of a graph
by: Parab, Shivani Tushar, et al.
Published: (2024)

On $\{1,2\}$-distance-balancedness of generalized Petersen graphs
by: Ma, Gang, et al.
Published: (2024)

The exponential distance matrix of bi-block graphs
by: Das, Joyentanuj, et al.
Published: (2025)

Enumeration of spanning trees and resistance distances of generalized blow-up graphs
by: Liu, Hechao, et al.
Published: (2025)

A $q$-analogue of distance matrix of bi-block graphs
by: Das, Joyentanuj
Published: (2025)

A classification of two-distance-transitive Cayley graphs over the generalized quaternion groups
by: Jin, Wei, et al.
Published: (2025)

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
by: Xiong, Yanzhen, et al.
Published: (2026)

Every Poset has a Large Cut
by: Linial, Nati, et al.
Published: (2025)

Almost all graphs have no cospectral mate with fixed level
by: Wang, Wei, et al.
Published: (2025)

On integer distance sets
by: Greenfeld, Rachel, et al.
Published: (2024)

A generalization of Zhu's theorem on six-valent integer distance graphs
by: Cervantes, Jonathan, et al.
Published: (2023)

On the distance spectral gap and construction of D-equienergetic graphs
by: T, Haritha, et al.
Published: (2025)

Trellis codes with a good distance profile constructed from expander graphs
by: Zhu, Yubin, et al.
Published: (2026)

On irreducibility of eccentricity matrix of graphs and construction of $ε-$equienergetic graphs
by: Ashokan, Anjitha, et al.
Published: (2024)