9 papers · 1 filter
Edge and spectral conditions for rainbow pancyclicity in graph collections
Lihua You, Xiaoxue Zhang, Xinghui Zhao
Let be a collection of not necessarily distinct -vertex graphs with a common vertex set . A cycle with and $|E(C)|\leq…
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 contained…
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…
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…
Saturation numbers of
Xiaoxue Zhang, Lihua You, Xinghui Zhao
A graph is called -saturated if contains no copy of , but contains a copy of for any edge . The saturation number of is the minimu…
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 …