Indexed metadata

Maximum index of unbalanced signed graphs without a positive odd cycle

Li Ma, Linfeng Xie, Xiaogang Liu

Source record

Source: arXiv

Published: Oct 11, 2026

arXiv: 2610.15383

Open original source ↗

Source abstract

Let Cr+\mathcal{C}_{r}^+ be the set of all balanced signed graphs with underlying graphs CrC_r. A signed graph is called Cr+\mathcal{C}_{r}^+-free if it contains no subgraph isomorphic to any member of Cr+\mathcal{C}_{r}^+. In this paper, we characterize the extremal graphs that achieve the maximum index among all C2k+1+\mathcal{C}_{2k+1}^+-free unbalanced signed graphs of order nn when k≥2k\ge 2 and n≥187kn\ge 187k.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Maximum index of unbalanced signed graphs without a positive odd cycle — Mathematical Frontier Network