Almost all graphs have no cospectral mates with height relative small to its order

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Zhao, Da
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911624838774784
author Zhao, Da
author_facet Zhao, Da
contents The main result of this paper shows that almost all graphs of order $n$ have no cospectral mates with height $o(( n / \ln n)^{1/10})$, improving an earlier result on cospectral mates with fixed level and covering the cospectral graphs obtained by GM-switching of relative small blocks.
format Preprint
id arxiv_https___arxiv_org_abs_2604_02165
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Almost all graphs have no cospectral mates with height relative small to its order
Zhao, Da
Combinatorics
Spectral Theory
05C50, 05C60, 05C80, 35P99
The main result of this paper shows that almost all graphs of order $n$ have no cospectral mates with height $o(( n / \ln n)^{1/10})$, improving an earlier result on cospectral mates with fixed level and covering the cospectral graphs obtained by GM-switching of relative small blocks.
title Almost all graphs have no cospectral mates with height relative small to its order
topic Combinatorics
Spectral Theory
05C50, 05C60, 05C80, 35P99
url https://arxiv.org/abs/2604.02165