View in EDS

A Study on Anti-Adjacency Spectra of Graphs.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 191260322
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Study on Anti-Adjacency Spectra of Graphs.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Falguni+Jain%2C+D%2E%22">Falguni Jain, D.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> falguni.d@res.christuniversity.in</i><br /><searchLink fieldCode="AR" term="%22Naduvath%2C+Sudev%22">Naduvath, Sudev</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> sudev.nk@christuniversity.in</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Interconnection+Networks%22">Journal of Interconnection Networks</searchLink>. Mar2026, Vol. 26 Issue 1, p1-15. 15p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Eigenvalues%22">Eigenvalues</searchLink><br /><searchLink fieldCode="DE" term="%22Power+spectra%22">Power spectra</searchLink><br /><searchLink fieldCode="DE" term="%22Geometric+vertices%22">Geometric vertices</searchLink><br /><searchLink fieldCode="DE" term="%22Matrices+%28Mathematics%29%22">Matrices (Mathematics)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=191260322
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1142/S0219265924500294
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 15
        StartPage: 1
    Subjects:
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Eigenvalues
        Type: general
      – SubjectFull: Power spectra
        Type: general
      – SubjectFull: Geometric vertices
        Type: general
      – SubjectFull: Matrices (Mathematics)
        Type: general
    Titles:
      – TitleFull: A Study on Anti-Adjacency Spectra of Graphs.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Falguni Jain, D.
      – PersonEntity:
          Name:
            NameFull: Naduvath, Sudev
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 02192659
          Numbering:
            – Type: volume
              Value: 26
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Journal of Interconnection Networks
              Type: main
ResultId 1