Geodesic
The maximum signless Laplacian spectral radius of graphs with forbidden subgraphs
Filomat, Tome 37 (2023) no. 24, p. 8319

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

DOI

The Brualdi-Solheid-Turán type problem has attracted wide attention recently. Let F be a set of graphs. A graph G is F-free if it does not contain any element of F as a subgraph. In this paper, when F 1 = {W 5 , C 6 } and F 2 = {F 5 }, we determine the maximum signless Laplacian spectral radius of F i-free graph with n vertices, respectively and depict the corresponding extremal graph for i = 1, 2.
DOI : 10.2298/FIL2324319C
Classification : 05C50, 05C35, 05C38
Keywords: Extremal graph, Spectral Turán problem, Signless Laplacian spectral radius, F -free graph 
Dandan Chen; Xiaoling Ma. The maximum signless Laplacian spectral radius of graphs with forbidden subgraphs. Filomat, Tome 37 (2023) no. 24, p. 8319 . doi: 10.2298/FIL2324319C
@article{10_2298_FIL2324319C,
     author = {Dandan Chen and Xiaoling Ma},
     title = {The maximum signless {Laplacian} spectral radius of graphs with forbidden subgraphs},
     journal = {Filomat},
     pages = {8319 },
     year = {2023},
     volume = {37},
     number = {24},
     doi = {10.2298/FIL2324319C},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2324319C/}
}
TY  - JOUR
AU  - Dandan Chen
AU  - Xiaoling Ma
TI  - The maximum signless Laplacian spectral radius of graphs with forbidden subgraphs
JO  - Filomat
PY  - 2023
SP  - 8319 
VL  - 37
IS  - 24
UR  - http://geodesic.mathdoc.fr/articles/10.2298/FIL2324319C/
DO  - 10.2298/FIL2324319C
LA  - en
ID  - 10_2298_FIL2324319C
ER  - 
%0 Journal Article
%A Dandan Chen
%A Xiaoling Ma
%T The maximum signless Laplacian spectral radius of graphs with forbidden subgraphs
%J Filomat
%D 2023
%P 8319 
%V 37
%N 24
%U http://geodesic.mathdoc.fr/articles/10.2298/FIL2324319C/
%R 10.2298/FIL2324319C
%G en
%F 10_2298_FIL2324319C

Cité par Sources :