Skip to main content
Top
Published in: Journal of Applied Mathematics and Computing 1-2/2017

12-05-2016 | Original Research

Maximal Estrada index of unicyclic graphs with perfect matching

Author: Zhongxun Zhu

Published in: Journal of Applied Mathematics and Computing | Issue 1-2/2017

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

For a graph G, the Estrada index is defined as EE \((G)=\sum _{i=1}^ne^{\lambda _i},\) where \(\lambda _i(1\le i\le n)\) is eigenvalue of the adjacency matrix of G. Let \(\mathscr {U}(2\beta ,\beta )\) be the class of unicyclic graphs on \(2\beta \) vertices with perfect matching. In this paper, we give an algorithm to construct the extremal graph in \(\mathscr {U}(2\beta ,\beta )\) with maximal Estrada index and the graphs in \(\mathscr {U}(2\beta ,\beta )\) with the maximal Estrada index is characterized.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference Cvetković, D., Doob, M., Sachs, H.: Spectra of Graphs Theory and Application. Academic Press, New York (1980)MATH Cvetković, D., Doob, M., Sachs, H.: Spectra of Graphs Theory and Application. Academic Press, New York (1980)MATH
4.
go back to reference Du, Z., Zhou, B.: On the Estrada index of graphs with given number of cut edges. Electron. J. Linear Al. 22, 586–592 (2011)MathSciNetMATH Du, Z., Zhou, B.: On the Estrada index of graphs with given number of cut edges. Electron. J. Linear Al. 22, 586–592 (2011)MathSciNetMATH
6.
go back to reference Estrada, E.: Characterization of 3D molecular structure. Chem. Phys. Lett. 319, 713–718 (2000)CrossRef Estrada, E.: Characterization of 3D molecular structure. Chem. Phys. Lett. 319, 713–718 (2000)CrossRef
7.
go back to reference Estrada, E.: Characterization of the folding degree of proteins. Bioinformatics 18, 697–704 (2002)CrossRef Estrada, E.: Characterization of the folding degree of proteins. Bioinformatics 18, 697–704 (2002)CrossRef
8.
go back to reference Estrada, E.: Topological structural classes of complex networks. Phys. Rev. E 75, 016103-1–016103-12 (2007)CrossRef Estrada, E.: Topological structural classes of complex networks. Phys. Rev. E 75, 016103-1–016103-12 (2007)CrossRef
9.
go back to reference Estrada, E.: Characterization of the amino acid contribution to the folding degree of proteins. Proteins 54, 727–737 (2004)CrossRef Estrada, E.: Characterization of the amino acid contribution to the folding degree of proteins. Proteins 54, 727–737 (2004)CrossRef
10.
go back to reference Estrada, E., Rodríguez-Valázquez, J.A.: Subgraph centrality in complex networks. Phys. Rev. E 71, 0561031–0561039 (2005)MathSciNetCrossRef Estrada, E., Rodríguez-Valázquez, J.A.: Subgraph centrality in complex networks. Phys. Rev. E 71, 0561031–0561039 (2005)MathSciNetCrossRef
11.
go back to reference Estrada, E., Rodríguez-Valázquez, J.A.: Spectral measures of bipartivity in complex networks. Phys. Rev. E 72, 0461051–0461056 (2005)MathSciNetCrossRef Estrada, E., Rodríguez-Valázquez, J.A.: Spectral measures of bipartivity in complex networks. Phys. Rev. E 72, 0461051–0461056 (2005)MathSciNetCrossRef
12.
go back to reference Estrada, E., Rodríguez-Valázquez, J.A., Randić, M.: Atomic branching in molecules. Int. J. Quantum Chem. 106, 823–832 (2006)CrossRef Estrada, E., Rodríguez-Valázquez, J.A., Randić, M.: Atomic branching in molecules. Int. J. Quantum Chem. 106, 823–832 (2006)CrossRef
14.
go back to reference Gutman, I., Furtula, B., Zogić, E., Glogić, E.: Resolvent energy of graphs. MATCH Commun. Math. Comput. Chem. 75, 279–290 (2016)MathSciNet Gutman, I., Furtula, B., Zogić, E., Glogić, E.: Resolvent energy of graphs. MATCH Commun. Math. Comput. Chem. 75, 279–290 (2016)MathSciNet
16.
go back to reference Li, J., Li, X., Wang, L.: The minimal Estrada index of trees with two maximum degree vertices. MATCH Commun. Math. Comput. Chem. 64, 799–810 (2010)MathSciNetMATH Li, J., Li, X., Wang, L.: The minimal Estrada index of trees with two maximum degree vertices. MATCH Commun. Math. Comput. Chem. 64, 799–810 (2010)MathSciNetMATH
17.
go back to reference Shang, Y.: Local natural connectivity in complex networks. Chin. Phys. Lett. 28, 068903 (2011)CrossRef Shang, Y.: Local natural connectivity in complex networks. Chin. Phys. Lett. 28, 068903 (2011)CrossRef
18.
go back to reference Shang, Y.: Biased edge failure in scale-free networks based on natural connectivity. Indian J. Phys. 86, 485–488 (2012)CrossRef Shang, Y.: Biased edge failure in scale-free networks based on natural connectivity. Indian J. Phys. 86, 485–488 (2012)CrossRef
19.
go back to reference Shang, Y.: Random lifts of graphs: network robustness based on the Estrada index. Appl. Math. E-Notes 12, 53–61 (2012)MathSciNetMATH Shang, Y.: Random lifts of graphs: network robustness based on the Estrada index. Appl. Math. E-Notes 12, 53–61 (2012)MathSciNetMATH
20.
24.
go back to reference Zhou, B., Trinajstić, N.: Estrada index of bipartite graphs. Int. J. Chem. Model. 1, 387–394 (2008) Zhou, B., Trinajstić, N.: Estrada index of bipartite graphs. Int. J. Chem. Model. 1, 387–394 (2008)
Metadata
Title
Maximal Estrada index of unicyclic graphs with perfect matching
Author
Zhongxun Zhu
Publication date
12-05-2016
Publisher
Springer Berlin Heidelberg
Published in
Journal of Applied Mathematics and Computing / Issue 1-2/2017
Print ISSN: 1598-5865
Electronic ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-016-1014-y

Other articles of this Issue 1-2/2017

Journal of Applied Mathematics and Computing 1-2/2017 Go to the issue

Premium Partner