Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Jain, D. Falguni; Naduvath, Sudev Title A name given to the resource Some new results on anti-adjacency spectra of regular graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2026 Source A related resource from which the described resource is derived Asian-European Journal of Mathematics;Volume;19;Issue;2;Article No.;2540008; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S179355712540008X" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S179355712540008X</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105004399603?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105004399603?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Jain D.F., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India Description An account of the resource 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. Subject The topic of the resource anti-adjacency eigenvalues; Anti-adjacency matrix; anti-adjacency spectrum Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 17935571; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online