4 papers
math.CO2019
Gallai-Ramsey numbers for rainbow paths
Xihe Li, Pierre Besse, Colton Magnant +2
Given graphs and and a positive integer , the \emph{Gallai-Ramsey number}, denoted by is defined to be the minimum integer such that every coloring o…
math.CO2018
Gallai-Ramsey numbers for a class of graphs with five vertices
Xihe Li, Ligong Wang
Given two graphs and , the -colored Gallai-Ramsey number is defined to be the minimum integer such that every -coloring of the complete graph on …
math.CO2018
Forbidden rainbow subgraphs that force large monochromatic or multicolored k-connected subgraphs
Xihe Li, Ligong Wang
Let be positive integers with , and let be the set of graphs of order at least 3 such that there is a -connected monochromatic subgraph…
math.CO2018
The unicyclic graphs with the second smallest normalized Laplacian eigenvalue no less than
Weige Xi, Ligong Wang, Xiangxiang Liu +2
Let be the second smallest normalized Laplacian eigenvalue of a graph . In this paper, we determine all unicyclic graphs of order with $λ_{2}(G)\geq 1-\frac…