Skip to main content

Properties of Characteristic Polynomials of Oriented Graphs

  • Conference paper
  • First Online:
New Trends in Applied Analysis and Computational Mathematics

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1356))

  • 186 Accesses

Abstract

Corresponding to a graph, one can define several matrices, and finding the eigenvalues of such matrices gives us the spectrum. Graph energy is defined as the sum of the absolute values of the eigenvalues and it has important applications related to molecular graphs. In this paper, we introduce some spectral properties of oriented graphs. We determine characteristic polynomials of several oriented graph classes, the effect of edge addition to characteristic polynomial, and also give several recursive results for the characteristic polynomial of an oriented graph by means of cut vertices, bridges, paths, and pendant edges.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. A.E. Brouwer, W.H. Haemers, Spectra of graphs (2012)

    Google Scholar 

  2. F. Celik, I.N. Cangul, Formulae and recurrence relations on spectral polynomials of some graphs. Adv. Stud. Contemp. Math. 27(3), 325–332 (2017)

    MATH  Google Scholar 

  3. K.C. Das, P. Kumar, Some new bounds on the spectral radius of graphs. Discret. Math. 281, 149–161 (2004)

    Article  MathSciNet  Google Scholar 

  4. M. Demirci, U. Ana, I.N. Cangul, Characteristic polynomials of oriented graphs (communicated)

    Google Scholar 

  5. N. Jahanbakht, Energy of graphs and digraphs (2010)

    Google Scholar 

  6. M.K. Kumar, Characteristic polynomial and domination energy of some special class of graphs. Int. J. Math. Comb. 1, 37–48 (2014)

    MATH  Google Scholar 

  7. J. Shu, Y. Wu, Sharp upper bounds on the spectral radius of graphs. Linear Algebr. Appl. 377, 241–248 (2004)

    Article  MathSciNet  Google Scholar 

  8. A. Yu, M. Lu, F. Tian, On the spectral radius of graphs. Linear Algebr. Appl. 387, 41–49 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Musa Demirci .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Demirci, M., Ana, U., Cangul, I.N. (2021). Properties of Characteristic Polynomials of Oriented Graphs. In: Paikray, S.K., Dutta, H., Mordeson, J.N. (eds) New Trends in Applied Analysis and Computational Mathematics. Advances in Intelligent Systems and Computing, vol 1356. Springer, Singapore. https://doi.org/10.1007/978-981-16-1402-6_5

Download citation

Publish with us

Policies and ethics