Sasmita Barik

Let G be a graph and be the adjacency matrix of G. Let be a positive integer. Then G is said to have the property m-(R) if is an eigenvalue of G whenever λ is an eigenvalue of G. Further, if λ and have the same multiplicity for each eigenvalue λ, then we say that G satisfies property m-(SR). In this article, we provide a class of graphs with property m-(SR) using the corona operation. We prove that a tree satisfying property m-(R) must be singular.

Advanced search Linear and Multilinear Algebra Latest Articles Submit an article Journal homepage Full Article Figures & data References Citations Metrics Reprints & Permissions Read this article /doi/full/10.1080/03081087.2025.2546898?needAccess=true Abstract Let G be a multidigraph without self-loops. The complex Laplacian matrix of G, denoted by LC(G), is defined in Barik et al. [On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs.