Geodesic
The maximum spectral radius of graphs without friendship subgraphs
Sebastian Cioabă1 ; Lihua Feng2 ; Michael Tait3 ; Xiao-Dong Zhang4
1University of Delaware
2Central South University
3Villanova University
4Shanghai Jiao Tong University
The electronic journal of combinatorics, Tome 27 (2020) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A graph on $2k+1$ vertices consisting of $k$ triangles which intersect in exactly one common vertex is called a $k-$friendship graph and denoted by $F_k$. This paper determines the graphs of order $n$ that have the maximum (adjacency) spectral radius among all graphs containing no $F_k$, for $n$ sufficiently large.
DOI : 10.37236/9179
Classification : 05C50, 05C38, 05C35
Mots-clés : friendship graph, adjacency matrix, spectral radius

Sebastian Cioabă   1   ; Lihua Feng  2   ; Michael Tait  3   ; Xiao-Dong Zhang  4

1 University of Delaware
2 Central South University
3 Villanova University
4 Shanghai Jiao Tong University 
@article{10_37236_9179,
     author = {Sebastian Cioab\u{a}  and Lihua Feng and Michael Tait and Xiao-Dong Zhang},
     title = {The maximum spectral radius of graphs without friendship subgraphs},
     journal = {The electronic journal of combinatorics},
     year = {2020},
     volume = {27},
     number = {4},
     doi = {10.37236/9179},
     zbl = {1453.05059},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/9179/}
}
TY  - JOUR
AU  - Sebastian Cioabă 
AU  - Lihua Feng
AU  - Michael Tait
AU  - Xiao-Dong Zhang
TI  - The maximum spectral radius of graphs without friendship subgraphs
JO  - The electronic journal of combinatorics
PY  - 2020
VL  - 27
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/9179/
DO  - 10.37236/9179
ID  - 10_37236_9179
ER  - 
%0 Journal Article
%A Sebastian Cioabă 
%A Lihua Feng
%A Michael Tait
%A Xiao-Dong Zhang
%T The maximum spectral radius of graphs without friendship subgraphs
%J The electronic journal of combinatorics
%D 2020
%V 27
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/9179/
%R 10.37236/9179
%F 10_37236_9179
Sebastian Cioabă ; Lihua Feng; Michael Tait; Xiao-Dong Zhang. The maximum spectral radius of graphs without friendship subgraphs. The electronic journal of combinatorics, Tome 27 (2020) no. 4. doi: 10.37236/9179

Cité par Sources :