Metraipolis › archive › dc_239281a5eb91

The Maximum Second Zagreb Spectral Radius of Trees, Unicyclic Graphs and Bicyclic Graphs — arXiv:2611.05057

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05057
License (as archived)
CC0-1.0
Archived
2026-11-04T19:00:22.804Z
SHA-256 of the archived text
6455d842599db04b79ac14a98c2c0d3cf8c9b0441d627cdd8bfb190e7bd22fb1
Stable URL of this page
https://metraipolis.com/documento/dc_239281a5eb91

How to cite

The Maximum Second Zagreb Spectral Radius of Trees, Unicyclic Graphs and Bicyclic Graphs — arXiv:2611.05057 — arXiv (en), https://arxiv.org/abs/2611.05057 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_239281a5eb91 (Metraipolis archive dc_239281a5eb91, sha256 6455d842599db04b79ac14a98c2c0d3cf8c9b0441d627cdd8bfb190e7bd22fb1)
BibTeX
@misc{dc239281a5eb91,
  title = {The Maximum Second Zagreb Spectral Radius of Trees, Unicyclic Graphs and Bicyclic Graphs — arXiv:2611.05057},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05057},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_239281a5eb91; sha256 6455d842599db04b79ac14a98c2c0d3cf8c9b0441d627cdd8bfb190e7bd22fb1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05057. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The second Zagreb matrix of a graph $G$ is $Z(G)=D(G)A(G)D(G)$, where $D(G)$ and $A(G)$ are the degree matrix and the adjacency matrix of $G$. For many degree-based weighted adjacency matrices, the trees, unicyclic graphs and bicyclic graphs with the largest spectral radius have a vertex adjacent to all others, and Mei et al. conjectured this for every such matrix on unicyclic graphs. Jiang et al. showed that $Z(G)$ is a counterexample. We prove that, for $q\in\{0,1,2\}$ and every $n\ge4$, the connected graph of order $n$ and cyclomatic number $q$ maximizing the spectral radius of $Z(G)$ is unique, and is obtained from two adjacent vertices with $q$ common neighbours by attaching $n-q-2$ pendent vertices to them as evenly as possible. The only exceptions are the star for $q=0$ and $n\le7$, and the triangle with one pendent vertex at each vertex for $q=1$ and $n=6$. This confirms a conjecture of Jiang et al.\ and all three parts of a conjecture of Shen and Shan for this matrix, with best possible thresholds on $n$. For $n\ge8$, the maximum value is $\lfloor (n+q)^2/4\rfloor+(n+q)/2+7q-2+O(1/n)$, whereas the star gives only $(n-1)^{3/2}$. A key tool is a determinant criterion that reduces spectral comparisons to sign conditions on explicit polynomials.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.05057 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:38:22.321Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).