Advanced search
Publication Cover
Linear and Multilinear Algebra Volume 69, 2021 - Issue 2
Submit an article Journal homepage
234
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

Complex adjacency spectra of digraphs

Gopinath SahooSchool of Basic Sciences, Indian Institute of Technology Bhubaneswar, Bhubaneswar, IndiaCorrespondence[email protected] [email protected]
ORCID Iconhttps://orcid.org/0000-0002-4390-5411View further author information
ORCID Icon
Pages 193-207 | Received 31 Aug 2017, Accepted 21 Sep 2018, Published online: 20 Mar 2019

References

  • Chartrand G, Lesniak L, Zhang P. Graphs and digraphs. New York: CRC Press; 2015.
  • Cvetković DM, Doob M, Sachs H. Spectra of graphs: theory and application. New York (NY): Academic Press; 1980.
  • Godsil C, Royle GF. Algebraic graph theory. New York (NY): Springer; 2001. (Graduate Texts in Mathematics; vol. 207).
  • Agaev R, Chebotarev P. Which digraphs with ring structure are essentially cyclic?. Adv Appl Math. 2010;45:232–251. doi: 10.1016/j.aam.2010.01.005
  • Brualdi RA. Spectra of digraphs. Linear Algebra Appl. 2010;432:2181–2213. doi: 10.1016/j.laa.2009.02.033
  • Comellas F, Daló C, Fiol MA, et al. The spectra of Manhattan street networks. Linear Algebra Appl. 2008;429:1823–1839. doi: 10.1016/j.laa.2008.05.018
  • Comellas F, Fiol MA, Gimbert J, et al. The spectra of wrapped butterfly digraphs. Networks. 2003;42:15–19. doi: 10.1002/net.10085
  • Gutman I, Plath PJ. On molecular graphs and digraphs of annulenes and their spectra. J Serb Chem Soc. 2001;66:237–241. doi: 10.2298/JSC0104237G
  • Lin H, Shu J. Spectral radius of digraphs with given dichromatic number. Linear Algebra Appl. 2011;434:2462–2467. doi: 10.1016/j.laa.2010.12.026
  • Mohar B. Eigenvalues and colorings of digraphs. Linear Algebra Appl. 2010;432:2273–2277. doi: 10.1016/j.laa.2009.05.027
  • Stevanović D, Stevanoović S. On relation between spectra of graphs and their digraph decompositions. Publ L'Inst Math. 2009;85:47–54. doi: 10.2298/PIM0999047S
  • Zhang F, Chen Z. Limit points of eigenvalues of (di) graphs. Czech Math J. 2006;56:895–902. doi: 10.1007/s10587-006-0064-y
  • Chebotarev PYu, Agaev RP. Coordination in multiagent systems and Laplacian spectra of digraphs. Autom Remote Control. 2009;70:136–151. doi: 10.1134/S0005117909030126
  • Su L, Li H-H, Zheng L-R. The Laplacian spectrum of some digraphs obtained from the wheel. Discuss Math Graph Theory. 2012;32:255–261. doi: 10.7151/dmgt.1612
  • Wu CW. Algebraic connectivity of directed graphs. Linear Multilinear Algebra. 2005;53:203–223. doi: 10.1080/03081080500054810
  • Bjelland J, Burgess M, Canright G, et al. Eigenvectors of directed graphs and importance scores: dominance, T-Rank, and sink remedies. Data Min Knowl Disc. 2010;20:98–151. doi: 10.1007/s10618-009-0154-1
  • Bapat RB, Kalita D, Pati S. On weighted directed graphs. Linear Algebra Appl. 2012;436:99–111. doi: 10.1016/j.laa.2011.06.035
  • Kalita D. Extremizing first eigenvalue of 3-colored digraphs made with given blocks. Linear Algebra Appl. 2016;503:83–99. doi: 10.1016/j.laa.2016.03.045
  • Dong J-G, Lin L. Laplacian matrices of general complex weighted directed graphs. Linear Algebra Appl. 2016;510:1–9. doi: 10.1016/j.laa.2016.08.011
  • Koren Y. On spectral graph drawing. Computing and combinatorics. Lect Notes Comput Sci. 2003;2697:496–508. doi: 10.1007/3-540-45071-8_50
  • Brouwer AE, Haemers WH. Spectra of graphs. New York (NY): Springer; 2011.
  • Minc H. Nonnegative matrices. New York: A Wiley-Interscience Publication; 1988.
  • Pillai SU, Suel T, Cha S. The Perron–Frobenius theorem: some of its applications. IEEE Signal Process Mag. 2005;22:62–75. doi: 10.1109/MSP.2005.1406483
  • Straffin PD. Linear algebra in geography: eigenvectors of networks. Math Mag. 1980;53:269–276. doi: 10.1080/0025570X.1980.11976869

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.