Minimal least eigenvalue of connected graphs of order n and size m = n + k (5≤k≤8)

doi:10.1007/s11464-019-0805-5

Front. Math. China

2019, Vol. 14

Issue (6) : 1213-1230 https://doi.org/10.1007/s11464-019-0805-5

RESEARCH ARTICLE

Minimal least eigenvalue of connected graphs of order n and size m = n + k (5≤k≤8)

Xin LI, Jiming GUO(

), Zhiwen WANG

Department of Mathematics, East China University of Science and Technology, Shanghai 200237, China

Download: PDF(617 KB)
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

Abstract

The least eigenvalue of a connected graph is the least eigenvalue of its adjacency matrix. We characterize the connected graphs of order n and size n + k (5≤k≤8 and n>k + 5) with the minimal least eigenvalue.

Keywords Least eigenvalue adjacency matrix graph

Corresponding Author(s): Jiming GUO

Issue Date: 07 January 2020

Cite this article:

Xin LI,Jiming GUO,Zhiwen WANG. Minimal least eigenvalue of connected graphs of order n and size m = n + k (5≤k≤8)[J]. Front. Math. China, 2019, 14(6): 1213-1230.

URL:

https://academic.hep.com.cn/fmc/EN/10.1007/s11464-019-0805-5
https://academic.hep.com.cn/fmc/EN/Y2019/V14/I6/1213

1	F K Bell, D Cvetković, P Rowlinson, S K Simić. Graphs for which the least eigenvalue is minimal, I. Linear Algebra Appl, 2008, 429: 234–241 https://doi.org/10.1016/j.laa.2008.02.032
2	F K Bell, D Cvetković, P Rowlinson, S K Simić. Graphs for which the least eigenvalue is minimal, II. Linear Algebra Appl, 2008, 429: 2168–2179, see also Erratum: from the editor-in-Chief, Linear Algebra Appl, 2010, 432: I–VI https://doi.org/10.1016/j.laa.2008.06.018
3	A Bhattacharya, S Friedland, U N Peled. On the first eigenvalue of bipartite graphs. Electron J Combin, 2008, 15(1): 144
4	D Cvetković, M Doob, H Sachs. Spectra of Graphs. Berlin: Academic Press, 1980
5	D Cvetković, P Rowlinson, S K. SimićSpectral Generalizations of Line Graphs. On graphs with least eigenvalue 2: Cambridge: Cambridge Univ Press, 2004 https://doi.org/10.1017/CBO9780511751752
6	D Cvetković, P Rowlinson, S Simić. An Introduction to the Theory of Graph Spectra. Cambridge: Cambridge Univ Press, 2010 https://doi.org/10.1017/CBO9780511801518
7	M Doob. A surprising property of the least eigenvalue of a graph. Linear Algebra Appl, 1982, 46: 1–7 https://doi.org/10.1016/0024-3795(82)90021-0
8	Y Fan, Y Wang, Y Gao. Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread. Linear Algebra Appl, 2008, 429: 577–588 https://doi.org/10.1016/j.laa.2008.03.012
9	M Petrović, T Aleksić, V Simić. Further results on the least eigenvalue of connected graphs. Linear Algebra Appl, 2011, 435: 2303–2313 https://doi.org/10.1016/j.laa.2011.04.030
10	M Petrović, B Borovićanin, T Aleksić. Bicyclic graphs for which the least eigenvalue is minimal. Linear Algebra Appl, 2009, 430: 1328–1335 https://doi.org/10.1016/j.laa.2008.10.026
11	L Voász, J Pelikán. On the eigenvalues of trees. Period Math Hungar, 1973, 3: 175–182 https://doi.org/10.1007/BF02018473
12	Y Wang, Y Fan. The least eigenvalue of a graph with cut vertices. Linear Algebra Appl, 2010, 433: 19–27 https://doi.org/10.1016/j.laa.2010.01.030
13	G Xu. Upper bound on the least eigenvalue of unicyclic graphs. J Zhejiang Forestry College, 1998, 15(3): 304–309 (in Chinese)
14	M Zhai, R Liu, J Shu. Minimizing the least eigenvalue of unicyclic graphs with fixed diameter. Discrete Math, 2010, 310: 947–955 https://doi.org/10.1016/j.disc.2009.09.017

[1]	Wen-Huan WANG, Ling YUAN. Uniform supertrees with extremal spectral radii[J]. Front. Math. China, 2020, 15(6): 1211-1229.
[2]	Yizheng FAN, Zhu ZHU, Yi WANG. Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices[J]. Front. Math. China, 2020, 15(3): 451-465.
[3]	Hongmei YAO, Li MA, Chunmeng LIU, Changjiang BU. Brualdi-type inclusion sets of Z-eigenvalues and l^k,s-singular values for tensors[J]. Front. Math. China, 2020, 15(3): 601-612.
[4]	Lihua YOU, Xiaohua HUANG, Xiying YUAN. Sharp bounds for spectral radius of nonnegative weakly irreducible tensors[J]. Front. Math. China, 2019, 14(5): 989-1015.
[5]	Kinkar Chandra DAS, Huiqiu LIN, Jiming GUO. Distance signless Laplacian eigenvalues of graphs[J]. Front. Math. China, 2019, 14(4): 693-713.
[6]	Thomas BRÜSTLE, Jie ZHANG. Non-leaving-face property for marked surfaces[J]. Front. Math. China, 2019, 14(3): 521-534.
[7]	Ziqiu LIU, Yunfeng ZHAO, Yuqin ZHANG. Perfect 3-colorings on 6-regular graphs of order 9[J]. Front. Math. China, 2019, 14(3): 605-618.
[8]	Jun HE, Yanmin LIU, Junkang TIAN, Xianghu LIU. Upper bounds for signless Laplacian Z-spectral radius of uniform hypergraphs[J]. Front. Math. China, 2019, 14(1): 17-24.
[9]	Xiaoxiao ZHANG, Aijin LIN. Positive solutions of p-th Yamabe type equations on graphs[J]. Front. Math. China, 2018, 13(6): 1501-1514.
[10]	Xiaofeng XUE. Phase transition for SIR model with random transition rates on complete graphs[J]. Front. Math. China, 2018, 13(3): 667-690.
[11]	Zhihe LIANG. *Super (a, d)-edge-antimagic total labelings of complete bipartite graphs*[J]. Front. Math. China, 2018, 13(1): 129-146.
[12]	Xiying YUAN, Xuelian SI, Li ZHANG. Ordering uniform supertrees by their spectral radii[J]. Front. Math. China, 2017, 12(6): 1393-1408.
[13]	Dongmei CHEN, Zhibing CHEN, Xiao-Dong ZHANG. Spectral radius of uniform hypergraphs and degree sequences[J]. Front. Math. China, 2017, 12(6): 1279-1288.
[14]	Shiying WANG, Zhenhua WANG, Mujiangshan WANG, Weiping HAN. *g-Good-neighbor conditional diagnosability of star graph networks under PMC model and MM model**[J]. Front. Math. China, 2017, 12(5): 1221-1234.
[15]	Hongjie SONG, Changqing XU. Neighbor sum distinguishing total chromatic number of K₄-minor free graph[J]. Front. Math. China, 2017, 12(4): 937-947.

Viewed

Full text

Abstract

Cited

Shared

Discussed