In this paper we construct several classes of non-regular graphs which are co-spectral with respect to all the three matrices, namely, adjacency, Laplacian and normalized Laplacian, and hence we answer a question asked by S. Butler. We make these constructions starting with two pairs (G1, H1) and (G2, H2) of A-cospectr...
A. Das, P. Panigrahi· Kragujevac Journal of Mathem...· 5 citations
The power graph $\mathscr{P}(G)$ of a group $G$ is defined as the simple graph with vertex set $G$, and two distinct vertices $x$ and $y$ are joined by an edge if and only if either $x= y^k$ or $y= x^k$, $k \in \mathbb{N}$. In this paper, first, we obtain the characteristic polynomial of $\mathscr{P}(\mathbb{Z}_m \time...
Komal Kumari, P. Panigrahi· Journal of Algebra Combinato...· 0 citations
Spectral Tur\'an-type problems ask how the absence of prescribed subgraphs constrains the spectral radius of a matrix associated with a graph. Given a family of graphs $\mathcal{F}$, a graph is called $\mathcal{F}$-free if it contains no member of $\mathcal{F}$ as a subgraph. The theta graph $\theta(l_1,\ldots,l_k)$ co...
M. Basunia, P. Panigrahi· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.