On the zero forcing number and spectral radius of graphs
The electronic journal of combinatorics, Tome 29 (2022) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In this paper, we determine the graphs (respectively, trees) with maximum spectral radius among all graphs (respectively, trees) with zero forcing number at most $k$. As an application, we give a sharp lower bound for the zero forcing number of graphs involving the spectral radius.
DOI : 10.37236/10638
Classification : 05C50, 05C15
Mots-clés : zero forcing number, spectral radius, \(k\)-tree

Wenqian Zhang  1   ; Jianfeng Wang  2   ; Weifan Wang  3   ; Shengjin Ji  1

1 Shandong University of Technology
2 School of Mathematics and Statistics Shandong University of Technology
3 Zhejiang Normal University
@article{10_37236_10638,
     author = {Wenqian Zhang and Jianfeng Wang and Weifan Wang and Shengjin Ji},
     title = {On the zero forcing number and spectral radius of graphs},
     journal = {The electronic journal of combinatorics},
     year = {2022},
     volume = {29},
     number = {1},
     doi = {10.37236/10638},
     zbl = {1493.05203},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/10638/}
}
TY  - JOUR
AU  - Wenqian Zhang
AU  - Jianfeng Wang
AU  - Weifan Wang
AU  - Shengjin Ji
TI  - On the zero forcing number and spectral radius of graphs
JO  - The electronic journal of combinatorics
PY  - 2022
VL  - 29
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/10638/
DO  - 10.37236/10638
ID  - 10_37236_10638
ER  - 
%0 Journal Article
%A Wenqian Zhang
%A Jianfeng Wang
%A Weifan Wang
%A Shengjin Ji
%T On the zero forcing number and spectral radius of graphs
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/10638/
%R 10.37236/10638
%F 10_37236_10638
Wenqian Zhang; Jianfeng Wang; Weifan Wang; Shengjin Ji. On the zero forcing number and spectral radius of graphs. The electronic journal of combinatorics, Tome 29 (2022) no. 1. doi: 10.37236/10638

Cité par Sources :