From the 1 of 6 linked papers with an AI index.
5 papers · 1 filter
Spectral extremal problems on planar and outerplanar graphs without $C_{k,l}
Jiamin Li, Dan Li, Xilong Yin +1
The paper determines the maximum spectral radius and the unique extremal planar and outerplanar graphs that avoid the graph C_{k,l} (two cycles sharing a vertex) for all large n.
Extremal distance spectral radius of graphs with -extra -component connectivity
Daoxia Zhang, Dan Li, Wenxiu Ding
For two integers and , the -extra -component connectivity of a graph , denoted by , is defined as the minimum number of vertices whose remo…
Spectral extremal problems on outerplanar and planar graphs
Xilong Yin, Dan Li
Let and be the maximum spectral radius over all -vertex -free outerplanar graphs and planar graphs, respect…
Extremal distance spectra of graphs and essential connectivity
Daoxia Zhang, Dan Li, Wenxiu Ding
A graph is non-trivial if it contains at least one nonloop edge. The essential connectivity of , denoted by , is the minimum number of vertices of whose removal prod…
Extremal spectral radius and -good -component connectivity
Wenxiu Ding, Dan Li, Yu Wang
For , if is a disconnected graph with at least components and each vertex has at least neighbors, then is called a -go…