Indexed metadata
Maximum index of unbalanced signed graphs without a positive odd cycle
Li Ma, Linfeng Xie, Xiaogang Liu
Source abstract
Let be the set of all balanced signed graphs with underlying graphs . A signed graph is called -free if it contains no subgraph isomorphic to any member of . In this paper, we characterize the extremal graphs that achieve the maximum index among all -free unbalanced signed graphs of order when and .
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.