3 papers
math.CO2025
Spectral condition for -factor-criticality in -connected graphs
Tingyan Ma, Edwin R. van Dam, Ligong Wang
A graph is called -factor-critical if has a perfect matching for every with . A connected graph is called -connected if it has more than $…
math.CO2024
Maximizing the spectral radius of graphs of given size with forbidden a subgraph
Yanting Zhang, Ligong Wang
Let denote the -vertex \textit{fan graph} consisting of a -vertex path plus a vertex adjacent to each vertex of the path. Let be the graph o…
math.CO2024
DQ-integral and DL-integral generalized wheel graphs
Yirui Chai, Ligong Wang, Yuwei Zhou
A graph G is said to be M-integral (resp. A-integral, D-integral, DL-integral or DQ-integral) if all eigenvalues of its matrix M (resp. adjacency matrix A(G), distance matrix D(G),…