On the Anti-Adjacency Spectra of Regular Graphs

Title

On the Anti-Adjacency Spectra of Regular Graphs

Creator

Falguni Jain, D.; Naduvath, Sudev

Description

For a graph G with vertex set V (G) = {v1, , vn}, the anti-adjacency matrix, denoted by A?(G) is a square matrix of order n with rows and columns indexed by V (G), whose (i, j)? entry (i ? j) is 1, if the vertices vi and vj are not adjacent and 0, otherwise. The diagonal entries of A?(G) is 1. The eigenvalues obtained from A?(G) are called the anti-adjacency eigenvalues of the graph G and the corresponding spectra is called the anti-adjacency spectra, denoted by a-spec(G). In this paper, we discuss the anti-adjacency spectra of connected and disconnected regular graphs and their complement graphs. 2025, SINUS Association. All rights reserved.

Source

Creative Mathematics and Informatics;Volume;34;Issue;2;pp.249-260

Date

01-01-2025

Publisher

SINUS Association

Subject

anti-adjacency algebra; anti-adjacency eigenvalues; Anti-adjacency matrix; anti-adjacency spectrum

Coverage

Falguni Jain D., Department of Mathematics, Christ University, Bangalore, 560029, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, 560029, India

Rights

All Open Access; Bronze Open Access

Relation

ISSN: 1584286X;

Format

online

Language

English

Type

Article

Identifier

https://doi.org/10.37193/CMI.2025.02.08

https://www.scopus.com/pages/publications/105018506852?origin=resultslist