HL-index of a graph
暂无分享,去创建一个
Let G be a simple, connected graph with n vertices and eigenvalues λ 1 > λ 2 ≥ … ≥ λ n . If n is even, define H = n /2 and L = H + 1. If n is odd, define H = L = ( n + 1)/2. Define the HL-index of G to be R ( G ) = max(| λ H |, | λ L |). The eigenvalues λ H and λ L appear in chemical graph theory in the study of molecular stability. In this paper, bounds on HL-index for chemical and general graphs are studied. It is shown that there exist graphs with arbitrarily large HL-index.
[1] I. Gutman,et al. Mathematical Concepts in Organic Chemistry , 1986 .
[2] Michael Doob,et al. Spectra of graphs , 1980 .
[3] Tomaž Pisanski,et al. HOMO-LUMO Maps for Fullerenes. , 2010, Acta chimica Slovenica.
[4] Fan Chung,et al. Spectral Graph Theory , 1996 .
[5] D. Cvetkovic,et al. An Introduction to the Theory of Graph Spectra: References , 2009 .
[6] A. Neumaier,et al. Distance Regular Graphs , 1989 .