双圈图的最大Estrada指数

Abstract

Abstract: Let \mathcal{B}^+_{n} be the set of bipartite bicyclic graphs with n vertices. In \mathcal{B}^+_{n}, ordering the graphs in terms of their maximal Estrada indices was considered. With the aid of a relationship between the Estrada index and the largest eigenvalue of the bipartite graphs, we deduce the graphs with the largest and the second largest Estrada indices in \mathcal{B}^+_{n} for n\geq 8.

Key words: bicyclic graph, Estrada indices, eigenvalues of graph, bipartite

CLC Number:

O157.6

XU Weiwei, WANG Wenhuan. Bicyclic graph with the maximal Estrada indices[J]. Operations Research Transactions, 2014, 18(2): 111-118.

References

Cvetkovic D M, Doob M, Sachs H. Spectra of Graphs Theory and Application [M]. New York: Academic Press, 1980.
Estrada E. Characterization of 3D molecular structure [J]. Chemical Physics Letters, 2000, 319(5-6): 713-718.
Estrada E, Rodriguez-Velazquez J A. Subgraph centrality in complex networks [J]. Physical Review E, 2005, 71(5): 056103.
Estrada E. Topological structural classes of complex networks [J]. Physical Review E, 2007, 75: 016103.
Estrada E, Rodriguez-Velazquez J A. Spectral measures of bipartivity in complex networks [J]. Physical Review E, 2005, 72(4): 046105.
Estrada E, Rodriguez-Velazquez J A, Randic M. Atomic branching in molecules [J]. International Journal of Quantum Chemistry, 2006, 106(4): 823-832.
de la Pena J A, Gutman I, Rada J. Estimating the Estrada index [J]. Linear Algebra and its Applications, 2007, 427(1): 70-76.
Bamdad H, Ashraf F, Gutman I. Lower bounds for Estrada index and Laplacian Estrada index [J]. Applied Mathematics Letters, 2010, 23(7): 739-742.
Fath-Tabar G H, Ashrafi A R. New upper bounds for Estrada index of bipartite graphs [J]. Linear Algebra and its Applications, 2011, 435(10): 2607-2611.
Ashrafi A R, Fath-Tabar G H. Bounds on the Estrada index of ISR (4,6)-fullerenes [J]. Applied Mathematics Letters, 2011, 24(3): 337-339.
Deng H Y. A proof of a conjecture on the Estrada index [J]. Match-Communications in Mathematical and in Computer Chemistry, 2009, 62(3): 599-606.
Deng H Y. A note on the Estrada index of trees [J]. Match-Communications in Mathematical and in Computer Chemistry, 2009, 62(3): 607-610.
Ilic A, Stevanovic D. The Estrada index of chemical trees [J]. Journal of Mathematical Chemistry, 2010, 47(1): 305-314.
Li J, Li X L, Wang L S. The minimal Estrada index of trees with two maximum degree vertices [J]. Match-Communications in Mathematical and in Computer Chemistry, 2010, 64(3): 799-810.
Zhang J B, Zhou B, Li J P. On Estrada index of trees [J]. Linear Algebra and its Applications, 2011, 434(1): 215-223.
Du Z B, Zhou B. The Estrada index of trees [J]. Linear Algebra and its Applications, 2011, 435(10): 2462-2467.
Du Z B, Zhou B. On the Estrada index of graphs with given number of cut edges [J]. Electronic Journal of Linear Algebra, 2011, 22: 586-592.
Du Z B, Zhou B, Xing R. On maximum Estrada indices of graphs with given parameters [J]. Linear Algebra and its Applications, 2012, \bf 436(9): 3767-3772.
Du Z B, Zhou B. The Estrada index of unicyclic graphs [J]. Linear Algebra and its Applications, 2012, 436(9): 3149-3159.
Wang W H. The unicyclic graph with the maximal Estrada indices [J]. Match-Communications in Mathematical and in Computer Chemistry, 2012, 68(3): 939-955.
Hou Y P, Li J S. Bounds on the largest eigenvalues of trees with a given size of matching [J]. Linear Algebra and its Applications, 2002, 342: 203-217.
李乔, 冯克勤. 论图的最大特征根 [J]. 应用数学学报, 1979, 2(2): 167-175.
Guo S G. The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices [J]. Linear Algebra and its Applications, 2005, 408: 78-85.
Liu H Q, Lu M, Tian F. On the spectral radius of graphs with cut edges [J]. Linear Algebra and its Applications, 2004, 389: 139-145.
Wu B F, Xiao E L, Hong Y. The spectral radius of trees on k pendant vertices [J]. Linear Algebra and its Applications, 2005, 395: 343-349.
Guo S G. On the spectral radius of bicyclic graphs with n vertices and diameter d [J]. Linear Algebra and its Applications, 2007, 422: 119-132.

[1]	TAO Yanliang, HUANG Qiongxiang, CHEN Lin. Contraction graph method for the interval edge-colorings of graphs [J]. Operations Research Transactions, 2019, 23(2): 31-43.
[2]	LIU Yan, LEI Mengxia, HUANG Xiaoxian. Path-transformation graph of maximum matchings [J]. Operations Research Transactions, 2019, 23(2): 104-112.
[3]	ZHAI Ruonan, WANG Ligong, DONG Zhanpeng, WANG Zhanqing, MEI Ruoxing. Laplacian spectral characterizations of some classes of multi-cyclic graphs [J]. Operations Research Transactions, 2016, 20(2): 59-68.
[4]	JIAN Xiangguo,YUAN Xiying,ZHANG Man. The maximum signless Laplacian separator of unicyclic and bicyclic graphs [J]. Operations Research Transactions, 2015, 19(2): 99-104.
[5]	XIAO Mao, WANG Wenhuan. Minimal skew energies of oriented bicyclic graphs without even cycles [J]. Operations Research Transactions, 2014, 18(4): 85-95.
[6]	OUYANG Zhangdong, HUANG Yuanqiu. On the crossing number of products of K_3,3 with S_n [J]. Operations Research Transactions, 2014, 18(2): 69-76.
[7]	ZHAO Weiliang, ZHAO Yancai, LIANG Zuosong. NP-completeness for two generalized domination problems [J]. Operations Research Transactions, 2012, 16(3): 139-144.

Bicyclic graph with the maximal Estrada indices

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 7

Recommended Articles

Metrics

Comments