Advertisement

Wuhan University Journal of Natural Sciences

, Volume 24, Issue 6, pp 510–514 | Cite as

On the Spectral Moment of Quasi-Unicyclic Graphs

  • Yaping WuEmail author
  • Huiyi Guo
  • Shuai Yuan
Mathematics

Abstract

A connected graph G = (V(G), E(G)) is called a quasi-unicyclic graph, if there exists u0V(G) such that Gu0 is a unicyclic graph. Denote Q(n, d0) = {G: G is a quasi-unicyclic graph of order n with Gu0 being a unicyclic graph and dG(u0) = d0}. Let A(G) be the adjacency matrix of a graph G, and let λ1(G), λ2(G),…, λn(G) be the eigenvalues in non-increasing order of A(G). The number \(\sum\limits_{i = 1}^n {\lambda _i^k(G)} \) (k = 0,1, …, n−1) is called the k-th spectral moment of G, denoted by Sk (G). Let S (G) = (S0(G), S1(G),…, Sn−1(G)) be the sequence of spectral moments of G. For two graphs G1, G2, we have G1SG2 if for some k(k = 1,2,…, n−1), and we have Si(G1) = Si(G2) (i = 0,1, …, k−1) and Sk(G1) < Sk(G2). In this paper, we determine the second to the fourth largest quasi-unicyclic graphs, in an S-order, in the set Q(n, d0), respectively.

Key words

spectral moment unicyclic graph quasi-unicyclic graph 

CLC number

O 157.5 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bondy J A, Murty U S R. Graph Theory with Applications [M]. London: Macmillan, 1976.CrossRefGoogle Scholar
  2. [2]
    Cvetkovíc D, Doob M, Sachs H. Spectra of Graphs—Theory and Applications [M]. New York: Academic Press, 1980.Google Scholar
  3. [3]
    Harary F. Graph Theory [M]. Reading, MA: Addison-Wesley, 1968.Google Scholar
  4. [4]
    Gutman I, Rosenfeld V R. Spectral moments of polymer graphs [J]. Theoretica Chemica Acta, 1996, 93: 191–197.CrossRefGoogle Scholar
  5. [5]
    Gutman I, Trinajstíc N. Graph theory and molecular. Total electron energy of alternant hydrocarbons [J]. Chemical Physics Letters, 1972, 17: 535–538.CrossRefGoogle Scholar
  6. [6]
    Cvetkovíc D, Doob M, Sachs H, et al. Recent Results in the Theory of Graph Spectra, Annals of Discrete Mathematics Series [M]. Amsterdam: North-Holland, 1988.Google Scholar
  7. [7]
    Cvetkovíc D, Petríc M. A table of connected graphs on six vertices [J]. Discrete Mathematics, 1984, 50: 37–49.CrossRefGoogle Scholar
  8. [8]
    Cvetkovíc D, Rowlinson P. Spectra of unicyclic graphs [J]. Graph and Combinatorics, 1987, 7: 7–23.CrossRefGoogle Scholar
  9. [9]
    Fan Q, Wu Y P. Spectral moments sequence and lexicographical order of graphs [J]. Journal of Wuhan University (Nat Sci Ed), 2009, 55(6): 625–628(Ch).Google Scholar
  10. [10]
    Wu Y P, Fan Q. On the lexicographical ordering by spectral moments of bicyclic graphs [J]. Ars Combinatoria, 2014, 114: 213–222.Google Scholar
  11. [11]
    Wu Y P, Liu H Q. Lexicographical ordering by spectral moments of trees with a prescribed diameter [J]. Linear Algebra and Its Applications, 2010, 433: 1707–1713.CrossRefGoogle Scholar
  12. [12]
    Pan X F, Hu X L, Liu X G, et al. The spectral moments of trees with given maximum degree [J]. Applied Mathematics Letters, 2011, 24: 1265–1268.CrossRefGoogle Scholar
  13. [13]
    Cheng B, Liu B L. Lexicographical ordering by spectral moments of trees with k pendant vertices and integer partitions [J]. Applied Mathematics Letters, 2012, 25: 858–861.CrossRefGoogle Scholar
  14. [14]
    Cheng B, Liu B L, Liu J X. On the spectral moments of unicyclic graphs with fixed diameter [J]. Linear Algebra and Its Applications, 2012, 437: 1123–1131.CrossRefGoogle Scholar
  15. [15]
    Andriantiana E, Wagner S. Spectral moments of trees with given degree sequence [J]. Linear Algebra and Its Applications, 2013, 439: 3980–4002.CrossRefGoogle Scholar
  16. [16]
    Li S C, Song Y B. On the spectral moment of trees with given degree sequences [EB/OL]. [2012-09-11]. http://arxiv.org/abs/1209.2188.
  17. [17]
    Hu S N, Li S C. On the spectral moment of graphs with given clique number [J]. Rocky Mountain Journal of Mathematics, 2016, 46: 216–282.Google Scholar
  18. [18]
    Li S C, Zhang J J. Lexicographical ordering by spectral moments of trees with a given bipartition [J]. Bulletin Iranian Mathematical Society, 2014, 40: 1027–1045.Google Scholar
  19. [19]
    Li S C, Zhang H H, Zhang M J. On the spectral moment of graphs with k cut edges [J]. Electronic Journal of Linear Algebra, 2013, 26: 718–731.Google Scholar
  20. [20]
    Pan X F, Liu X G, Liu H Q. On the spectral moment of quasitrees [J]. Linear Algebra and Its Applications, 2012, 436: 927–934.CrossRefGoogle Scholar
  21. [21]
    Wu Y P, Fan Q, Yuan S. On the spectral moment of quasi-trees and quasi-unicyclic graphs [J]. Ars Combinatoria, 2018, 137: 335–344.Google Scholar
  22. [22]
    Nie Z B. Ordering Graphs with Respect to Spectral Moments [D]. Changsha: Normal University of Hunan, 2008(Ch).Google Scholar

Copyright information

© Wuhan University and Springer-Verlag GmbH Germany 2019

Authors and Affiliations

  1. 1.School of Mathematics and Computer ScienceJianghan UniversityHubeiChina
  2. 2.Department of MathematicsUniversity of WashingtonSeattleUSA
  3. 3.Department of Mathematical SciencesGeorgia Southern UniversityStatesboroUSA

Personalised recommendations