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.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
Issue
Section
License
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike (CC BY-SA) license. This ensures that the content is freely available to all users and can be shared and adapted, provided appropriate credit is given and any adaptations are distributed under the same license.
Copyright Holder
The copyright of all 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). This applies to all published versions, including the HTML and PDF formats of the articles.
Author Rights
While the Departemen Matematika dan Sains Data FMIPA UNAND holds the copyright for all published content, authors retain important rights under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA). This license grants authors and users the following rights:
- Reuse: Authors can reuse and distribute their work for any lawful purpose, including sharing on personal websites, institutional repositories, or in subsequent publications.
- Attribution and Adaptation: Authors and others may remix, adapt, and build upon the published work for any purpose, even commercially, as long as proper credit is given to the original authors, and any derivative works are distributed under the same CC BY-SA license.
Creative Commons License (CC BY-SA)
Under the terms of the CC BY-SA 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, even commercially.
However, the following conditions apply:
- Attribution: Users must give appropriate credit to the original author(s) and Departemen Matematika dan Sains Data FMIPA UNAND, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author or the journal.
- ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same license as the original.
For more information about the CC BY-SA license, please visit the Creative Commons website.
Third-Party Content
If authors include third-party material (such as figures, tables, or images) that is not covered by a Creative Commons license, they must obtain the necessary permissions for reuse and provide proper attribution. Authors are required to ensure that any third-party content complies with open-access licensing requirements or includes permissions for redistribution under similar terms.
Copyright and Licensing Information Display
The copyright and licensing terms will be clearly displayed on each article's landing page, as well as within the full-text versions (HTML and PDF) of all published articles.
No "All Rights Reserved"
As an open-access journal, JMUA does not use "All Rights Reserved" policies. Instead, the CC BY-SA license ensures that the works remain accessible and reusable for a wide audience while still protecting both the authors' and the copyright holder's rights.
Â
