Central vertex join and central edge join of two graphs
The central graph $C(G)$ of a graph $G$ is obtained by sub dividing each edge of $G$ exactly once and joining all the nonadjacent vertices in $G$. In this paper, we compute the adjacency, Laplacian and signless Laplacian spectra of central graph of a connected regular graph. Also, we define central...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2020-09-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/10.3934/math.2020461/fulltext.html |