10 papers
Two problems on booksize and triangular edges in Nosal graphs
Xinghui Zhao, Lihua You, Jing Zeng +1
A graph with edges is said to be a Nosal graph if . For a graph , we write for its maximum book size and for the number of edges containe…
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…
The signless Laplacian spectral radius of graphs without disjoint cliques
Xinghui Zhao, Lihua You, Jing Zeng
A graph is -free if it contains no pairwise vertex-disjoint copies of . Moon [Canad. J. Math. 20 (1968) 95-102] and Simonovits [Theory of Graphs (P…
Oriented diameter of graphs with diameter and given edge girth
Jifu Lin, Lihua You
Let be the smallest value for which every bridgeless graph with diameter admits a strong orientation such that the diameter of $\overrightarrow{…
On the characterizations of
Jing Zeng, Lihua You, Xinghui Zhao +1
The determinant of a tournament , denoted by , is defined as the determinant of the skew-adjacency matrix of . It is well-known that is equal to if …
The saturation number of
Xinghui Zhao, Lihua You, Xiaoxue Zhang
For a given graph , a graph is said to be -saturated if contains no copy of but for any edge , contains a copy of . The saturation number…