Skip to content
DraconiticResearch
Search Sources API
181,713 studies31 sourcesUpdated 17 min ago
PreprintarXiv licencearXiv

Spectral and edge conditions for negative Hamiltonian cycles in unbalanced signed graphs

  • Zihao Zha
Open at sourcePDFDOICite

Abstract

Spectral conditions for Hamiltonian cycles are a fundamental subject in extremal spectral graph theory. For simple unsigned graphs, Fiedler and Nikiforov [Linear Algebra Appl., 432 (2010), 2170-2173] pioneered this direction, and Li and Ning [Linear Multilinear Algebra, 64 (2016), 2252-2269] later extended these results by introducing minimum degree parameters. In this paper, we study the spectral conditions for the existence of a negative Hamiltonian cycle in unbalanced signed graphs of order n > 8. We first determine the maximum index among all n-vertex unbalanced signed graphs containing no negative Hamiltonian cycle, and characterize the corresponding extremal graphs up to switching isomorphism. Furthermore, we establish an upper bound on the number of edges in unbalanced signed graphs of order n >= 7 with frustration index one, and classify all extremal graphs achieving this bound.

Related

  1. Unbalanced spectral Turán problem for color-critical graphs with prescribed large maximum degree
    Chang Liu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Enumerating Hamiltonian Paths and Cycles
    Harry Hylock, Karl Michael Schmidt, Matthew C. Lettington
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. A Chvátal-type codegree condition for Hamiltonian cycles in k-uniform hypergraphs
    Lu-Ming Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. On the Minimum Number of Hamilton Cycles in Hamiltonian Threshold Graphs: A Simple Proof
    Chengli Li, Feng Liu
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  5. On the Number of Hamiltonian Cycles in a Boolean Cube
    A. L. Perezhogin, V. N. Potapov
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{zha2026spectral,
  title = {{Spectral and edge conditions for negative Hamiltonian cycles in unbalanced signed graphs}},
  author = {Zihao Zha},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.30883},
  eprint = {2610.30883},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.30883},
}
RIS
TY  - UNPB
TI  - Spectral and edge conditions for negative Hamiltonian cycles in unbalanced signed graphs
AU  - Zihao Zha
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.30883
UR  - https://arxiv.org/abs/2610.30883
AB  - Spectral conditions for Hamiltonian cycles are a fundamental subject in extremal spectral graph theory. For simple unsigned graphs, Fiedler and Nikiforov [Linear Algebra Appl., 432 (2010), 2170-2173] pioneered this direction, and Li and Ning [Linear Multilinear Algebra, 64 (2016), 2252-2269] later extended these results by introducing minimum degree parameters. In this paper, we study the spectral conditions for the existence of a negative Hamiltonian cycle in unbalanced signed graphs of order n > 8. We first determine the maximum index among all n-vertex unbalanced signed graphs containing no negative Hamiltonian cycle, and characterize the corresponding extremal graphs up to switching isomorphism. Furthermore, we establish an upper bound on the number of edges in unbalanced signed graphs of order n >= 7 with frustration index one, and classify all extremal graphs achieving this bound.
ER  -