5 papers
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…
The connectedness of friends-and-strangers graphs about graph parameters and others
Xinghui Zhao, Lihua You, Jifu Lin +1
Let and be two graphs of order . The friends-and-strangers graph of and is a graph whose vertex set consists of all bijections $σ: V(X)\righta…
Spectral conditions for spanning -trees or -ended-trees of -connected graphs
Jifu Lin, Zenan Du, Xinghui Zhao +1
Let be a connected graph of order . A spanning -tree of is a spanning tree with the maximum degree at most , and a spanning -ended-tree of is a spanning tre…
The existence of a spanning tree with leaf distance at least and leaf degree at most via the size or the spectral radius with respect to the minimum degree
Jifu Lin, Lihua You
Let , be a positive integer, be a connected graph of order , be a tree. The leaf distance of a tree is defined as the minimum distance between any two leaves. For…