Advanced search
Publication Cover
Linear and Multilinear Algebra Volume 70, 2022 - Issue 19
Submit an article Journal homepage
109
Views
2
CrossRef citations to date
0
Altmetric
Research Article

On the spectral radius and energy of digraphs

Juan R. Carmonaa Facultad de Ciencias – Instituto de Ciencias Físicas y Matemáticas, Universidad Austral de Chile, Valdivia, ChileCorrespondence[email protected]
ORCID Iconhttps://orcid.org/0000-0002-9961-9641View further author information
ORCID Icon &
Jonnathan Rodríguezb Departamento de Matemáticas, Facultad de Ciencias Básicas, Universidad de Antofagasta, Antofagasta, ChileORCID Iconhttps://orcid.org/0000-0001-7657-2986View further author information
ORCID Icon
Pages 4792-4803 | Received 14 Oct 2020, Accepted 25 Feb 2021, Published online: 18 Mar 2021

References

  • Liu MH, Tian GX, Cui SY. Some sharp bounds for the spectral radius and energy of digraphs. Ars Comb. 2016;127:45–55.
  • Cvetković DM, Doob M, Sachs H. Spectra of graph. Theory and application. New York: Academic Press; 1980.
  • Horn R, Johnson C. Matrix analysis. Cambridge University Press; 1985.
  • Gutman I. The energy of a graph. Ber Math Stat Sekt Forschungsz Graz. 1978;103:1–22.
  • Gutman I. The energy of a graph: old and new results. In: Betten A, Kohnert A, Laue R, editors. Algebraic combinatorics and applications. Berlin: Springer; 2001. p. 196–211.
  • Gutman I, Li X, Zhang J. Graph energy. In: Dehmer M, Emmert-Streib F, editors. Analysis of complex networks. From biology to linguistics. Weinheim: Wiley-VCH; 2009. p. 145–174.
  • Li X, Shi Y, Gutman I. Graph energy. New York (NY): Springer; 2012.
  • Andrade E, Carmona JR, Infante G, et al. A lower bound for the energy of hypoenergetic and non hypoenergetic graphs. MATCH Commun Math Comput Chem. 2020;83:579–592.
  • Andrade E, Carmona JR, Poveda A, et al. On the energy of singular and non singular graphs. MATCH Commun Math Comput Chem. 2020;83:593–610.
  • Bozkurt Altındağ ŞB, Bozkurt D. Lower bounds for the energy of (bipartite) graphs. MATCH Commun Math Comput Chem. 2017;77:9–14.
  • Gutman I, Furtula B, Zogic E, et al. Resolvent energy of graphs. MATCH Commun Math Comput Chem. 2016;75(2):279–290.
  • Jahanbani A, Rodríguez Z J. Koolen-Moulton-Type upper bounds on the energy of a graph. MATCH Commun Math Comput Chem. 2020;83:497–518.
  • Peña I, Rada J. Energy of digraphs. Linear Multilinear Algebra. 2008;56:565–579.
  • Ayyaswamy SK, Balachandran S, Gutman I. Upper bound for the energy of strongly connected digraphs. Appl Anal Discrete Math. 2011;5:37–45.
  • Brualdi R. Spectra of digraphs. Linear Algebra Appl. 2010;432:2181–2213.
  • Cruz R, Giraldo H, Rada J. An upper bound for the energy of radial digraphs. Linear Algebra Appl. 2014;442:75–81.
  • Gudiño E, Rada J. A lower bound for the spectral radius of a digraph. Linear Algebra Appl. 2010;433:233–240.
  • López W, Rada J. Equienergetic digraphs. Int J Pure Appl Math. 2007;36(3):361–372.
  • Rada J. The McClelland inequality for the energy of digraphs. Linear Algebra Appl. 2009;430:800–804.
  • Rada J. Bounds for the energy of normal digraphs. Linear Multilinear Algebra. 2012;60(3):323–332.
  • Moulton V, Koolen JH. Maximal energy graphs. Adv Appl Math. 2001;26:47–52.
  • Tian G-X, Cui S-Y. On upper bounds for the energy of digraphs. Linear Algebra Appl. 2013;438:4742–4749.
  • Liu H, Lu M, Tian F. Some upper bounds for the energy of graphs. J Math Chem. 2007;41:45–57.
  • Berman A, Plemmons RJ. Nonnegative matrices in the mathematical sciences. New York (NY): Academic; 1979. Philadelphia (PA): SIAM; 1994.
  • Hong Y, Zhang XD. Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees. Discrete Math. 2005;296:187–197.
  • Bozkurt Altındağ ŞB, Bozkurt D, Zhang X-D. On the spectral radius and the energy of a digraph. Linear Multilinear Algebra. 2015;63(10):2009–2016.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.