Bibliographic Details
| Title: |
A Study on Anti-Adjacency Spectra of Graphs. |
| Authors: |
Falguni Jain, D.1 (AUTHOR) falguni.d@res.christuniversity.in, Naduvath, Sudev1 (AUTHOR) sudev.nk@christuniversity.in |
| Source: |
Journal of Interconnection Networks. Mar2026, Vol. 26 Issue 1, p1-15. 15p. |
| Subjects: |
Graph theory, Eigenvalues, Power spectra, Geometric vertices, Matrices (Mathematics) |
| Abstract: |
Let G be a simple undirected graph with vertex set V (G) = { v 1 , ... , v n } and edge set E (G) = { e 1 , ... , e m }. The anti-adjacency matrix of G , denoted by A ∗ (G) , is the n × n matrix, whose rows and columns are indexed by V (G) , where each (i , j) -entry of the matrix is 1 , if there is no edge between the corresponding vertices v i and v j and 0 , otherwise. The (i , i) -entry of A ∗ (G) is 1 , for i = 1 , ... , n. The eigenvalues of A ∗ (G) represent the anti-adjacency eigenvalues of G. We denote the corresponding spectra by a -spec(G). In this paper, we discuss the anti-adjacency spectra of some fundamental graph classes. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Interconnection Networks is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
