{"title":"Universal adjacency spectrum of the cozero-divisor graph and its complement on a finite commutative ring with unity","authors":"Saraswati Bajaj, P. Panigrahi","doi":"10.1142/s1793830923501203","DOIUrl":null,"url":null,"abstract":"For a finite simple undirected graph [Formula: see text], the universal adjacency matrix [Formula: see text] is a linear combination of the adjacency matrix [Formula: see text], the degree diagonal matrix [Formula: see text], the identity matrix [Formula: see text] and the all-ones matrix [Formula: see text], that is [Formula: see text], where [Formula: see text] and [Formula: see text]. The cozero-divisor graph [Formula: see text] of a finite commutative ring [Formula: see text] with unity is a simple undirected graph with the set of all nonzero nonunits of [Formula: see text] as vertices and two vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] and [Formula: see text]. In this paper, we study structural properties of [Formula: see text] by defining an equivalence relation on its vertex set in terms of principal ideals of the ring [Formula: see text]. Then we obtain the universal adjacency eigenpairs of [Formula: see text] and its complement, and as a consequence one may obtain several spectra like the adjacency, Seidel, Laplacian, signless Laplacian, normalized Laplacian, generalized adjacency and convex linear combination of the adjacency and degree diagonal matrix of [Formula: see text] and [Formula: see text] in an unified way. Moreover, we get the universal adjacency eigenpairs of the cozero-divisor graph and its complement for a reduced ring and the ring of integers modulo [Formula: see text] in a simpler form.","PeriodicalId":504044,"journal":{"name":"Discrete Mathematics, Algorithms and Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics, Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1793830923501203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
For a finite simple undirected graph [Formula: see text], the universal adjacency matrix [Formula: see text] is a linear combination of the adjacency matrix [Formula: see text], the degree diagonal matrix [Formula: see text], the identity matrix [Formula: see text] and the all-ones matrix [Formula: see text], that is [Formula: see text], where [Formula: see text] and [Formula: see text]. The cozero-divisor graph [Formula: see text] of a finite commutative ring [Formula: see text] with unity is a simple undirected graph with the set of all nonzero nonunits of [Formula: see text] as vertices and two vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] and [Formula: see text]. In this paper, we study structural properties of [Formula: see text] by defining an equivalence relation on its vertex set in terms of principal ideals of the ring [Formula: see text]. Then we obtain the universal adjacency eigenpairs of [Formula: see text] and its complement, and as a consequence one may obtain several spectra like the adjacency, Seidel, Laplacian, signless Laplacian, normalized Laplacian, generalized adjacency and convex linear combination of the adjacency and degree diagonal matrix of [Formula: see text] and [Formula: see text] in an unified way. Moreover, we get the universal adjacency eigenpairs of the cozero-divisor graph and its complement for a reduced ring and the ring of integers modulo [Formula: see text] in a simpler form.