Some new results on anti-adjacency spectra of regular graphs

Title

Some new results on anti-adjacency spectra of regular graphs

Creator

Jain, D. Falguni; Naduvath, Sudev

Description

The anti-adjacency matrix A*(G) of a simple graph G with V (G) = {v1,v2,v3,vn}, is a square matrix of order n with rows and columns indexed by V (G), where the (i,j)-entry (i?j) is 1, if the vertices vi and vj are not adjacent to each other and 0, otherwise. The (i,i)- entry of A*(G) is 1. The anti-adjacency eigenvalues of G are the eigenvalues obtained from the matrix A*(G) and the corresponding spectra is called the anti-adjacency spectra of G, denoted by a-spec(G). In this paper, we discuss the anti-adjacency spectra of join and disjoint union of regular graphs. The anti-adjacency spectra of bipartite regular graphs, line graphs of regular graphs and strongly regular graphs are also discussed. 2026 World Scientific Publishing Company.

Source

Asian-European Journal of Mathematics;Volume;19;Issue;2;Article No.;2540008;

Date

01-01-2026

Publisher

World Scientific

Subject

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

Coverage

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

Rights

Restricted Access; Hardcopy may be available in the library

Relation

ISSN: 17935571;

Format

online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S179355712540008X

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