On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph
DOI:
https://doi.org/10.25077/jmu.11.1.74-81.2022Abstract
In this paper, we find the characteristic polynomial of the antiadjacency matrix of a line digraph. There are recent studies on the relation between the characteristic polynomial of the adjacency matrix and its line digraph, we are also interested in finding the connection between the antiadjacency matrix of a digraph and its line digraph. In this paper, we show the connection of characteristic polynomial of the antiadjacency matrix between an acyclic digraph and its line digraph.Downloads
References
R. B. Bapat, Graphs and matrices, Vol. 27, Springer, 2010.
S. Budiyanto, S. Utama, S. Aminah, Eigenvalues of antiadjacency matrix of directed cyclic dumbbell graph, in: Journal of Physics: Conference Series, Vol. 1108, IOP Publishing, 2018, p. 012015.
Murni, A. E. Hadi, I. Febry, Abdussakir, Anti-adjacency and laplacian spectra of inverse graph of group of integers modulo n, in: IOP Conference Series: Materials Science and Engineering, Vol. 807, IOP Publishing, 2020, p. 012033.
B. H. Aji, K. A. Sugeng, S. Aminah, Characteristic polynomial and eigenvalues of antiadjacency matrix of directed unicyclic flower vase graph, in: Journal of Physics: Conference Series, Vol. 1722, IOP Publishing, 2021, p. 012055.
A. Deng, M. Feng, A. Kelmans, Adjacency polynomials of digraph transformations, Discrete Applied Mathematics 206 (2016) 15–38.
D. Bravo, F. Cubr Ìıa, M. Fiori, V. Trevisan, Complementarity spectrum of digraphs, Linear Algebra and its Applications 627 (2021) 24–40.
C. Dalf Ìo, M. A. Fiol, M. Miller, J. Ryan, J. ˇSir Ìaˇn, An algebraic approach to lifts of digraphs, Discrete Applied Mathematics 269 (2019) 68–76.
J. Bang-Jensen, G. Z. Gutin, Digraphs: theory, algorithms and applications, Springer Science & Business Media, 2008.
D. Ferrero, Introduction to interconnection network models, Publ. Mat. Urug 99 (1999) 25.
C. Balbuena, D. Ferrero, X. Marcote, I. Pelayo, Algebraic properties of a digraph and its line digraph, Journal of Interconnection Networks 4 (04) (2003) 377–393.
F. Zhang, G. Lin, When a digraph and its line digraph are connected and cospectral, Discrete Mathematics 184 (1-3) (1998) 289–295.
S. Severini, On the structure of the adjacency matrix of the line digraph of a regular digraph, Discrete Applied Mathematics 154 (12) (2006) 1763–1765.
R. A. Horn, C. R. Johnson, Matrix analysis, Cambridge university press, 2013.
J. A. Bondy, U. S. R. Murty, Graph theory, volume 244 of, Graduate Texts in Mathematics 623 (2008).
G. Chartrand, L. Lesniak, P. Zhang, Graphs & digraphs, vol. 39 (2010).
G. Chartrand, P. Zhang, A first course in graph theory, Courier Corporation, 2013.
G. Chartrand, P. Zhang, Chromatic graph theory, Second Edition, Chapman and Hall/CRC, 2019.
M. A. Fiol, L. A. Yebra, A. De Miquel, Line digraph iterations and the (d, k) digraph problem, IEEE Transactions on Computers 100 (5) (1984) 400–403
Downloads
Published
How to Cite
Issue
Section
License
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.
Copyright Holder
The copyright of articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND), in accordance with the journal's stated copyright policy.
Author Rights
Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:
-
Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.
-
Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.
-
Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.
Creative Commons License (CC BY-SA 4.0)
Under the CC BY-SA 4.0 license, users are free to:
-
Share: Copy and redistribute the material in any medium or format.
-
Adapt: Remix, transform, and build upon the material for any purpose, including commercial purposes.
These permissions are subject to the following conditions:
-
Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.
-
ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.
-
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.
For more information about the CC BY-SA 4.0 license, please visit:
https://creativecommons.org/licenses/by-sa/4.0/
Third-Party Content
Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.
Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.
Copyright and Licensing Information
Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.
