Oct 2026
Zi-Dan Liu, Zhenzhen Lou, Jia-Qi Liu
· Computational and Applied Ma... · 0 citations
Save
{ copied = true; setTimeout(() => copied = false, 1500) })"
class="icon-btn" aria-label="Copy link">
{ copied = 'apa'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy APA
Copied ✓
{ copied = 'mla'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy MLA
Copied ✓
{ copied = 'bibtex'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy BibTeX
Copied ✓
Preprint
Sep 2026
Let \(G\) be a graph with \(m\) edges and adjacency spectral radius\(\rho(G)\), and let \(N(C_{2k+1},G)\) denote the number of copies of \(C_{2k+1}\) in \(G\). For each fixed integer \(k\ge 2\), define \( g_k(m):=\frac{k-1+\sqrt{4m-k^2+1}}{2}. \) Li, Zhai and Shu [European J. Combin., 2024] determined the spectral extr...
Jia-Qi Liu, Zhenzhen Lou, Shuang Sun
· 1 citation
Save
{ copied = true; setTimeout(() => copied = false, 1500) })"
class="icon-btn" aria-label="Copy link">
{ copied = 'apa'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy APA
Copied ✓
{ copied = 'mla'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy MLA
Copied ✓
{ copied = 'bibtex'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy BibTeX
Copied ✓
Preprint
Aug 2026
The $\text{bk}(G)$ of a graph $G$ is the maximum number of triangles sharing a common edge. Motivated by a classical conjecture of Erd\H{o}s, spectral lower bounds for the booksize have received considerable attention. For a positive divisor $s$ of $m-1$ with $\frac{m-1}{s}\ge2$, let $S_{m,s}^{+}$ be obtained from $K_{...
Benju Wang, Zhenzhen Lou, Jinlong Shu
· 0 citations
Save
{ copied = true; setTimeout(() => copied = false, 1500) })"
class="icon-btn" aria-label="Copy link">
{ copied = 'apa'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy APA
Copied ✓
{ copied = 'mla'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy MLA
Copied ✓
{ copied = 'bibtex'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy BibTeX
Copied ✓