4 papers · 1 filter
The maximum number of cycles of a given length in a nonhamiltonian graph
Jifu Lin, Xiaolin Wang, Lihua You
In 2026, Li and Zhan characterized the nonhamiltonian graphs of order with the maximum number of paths of length , where and are integers satisfying $1\leq k\leq n-1…
An improved upper bound on the oriented diameter of graphs with diameter
Jifu Lin, Xiaolin Wang, Lihua You
Let be the smallest value for which every bridgeless graph with diameter admits a strong orientation such that the diameter of $\overrightarrow{…
Size conditions for admissible or consecutive even cycles in graphs
Jifu Lin
In 2022, Gao, Huo, Liu, and Ma proved that every graph with minimum degree at least contains admissible cycles, where a set of cycles is said to be admissible if thei…
Signed graphs with exactly two main eigenvalues: The unicyclic case
Zenan Du, Fenjin Liu, Hechao Liu +2
An eigenvalue of a signed graph of order is called a main eigenvalue if its eigenspace is not orthogonal to the all-ones vector . Characterizing signed graphs with e…