Key points are not available for this paper at this time.
Let G be a graph on p vertices with adjacency matrix A (G) and degree matrix D (G). For each 0, 1, the A_-matrix is defined as A_ (G) = D (G) + (1 -) A (G). In this paper, we compute the A_-characteristic polynomial, A_-spectra and A_-energy of some non-regular graphs obtained from unary operations on graphs like middle graph, central graph, m-splitting, and closed splitting graph. Also, we determine the A_-energy of regular graphs like m-shadow, closed shadow, extended bipartite double graph, iterated line graph and m-duplicate graph. Furthermore, we identified some graphs that are A_-equieneregetic and A_-borderenergetic.
Building similarity graph...
Analyzing shared references across papers
Loading...
Najiya et al. (Fri,) studied this question.
synapsesocial.com/papers/68e70547b6db64358767f14e — DOI: https://doi.org/10.48550/arxiv.2404.03905
V K Najiya
National Institute of Technology Calicut
A V Chithra
National Institute of Technology Calicut
Building similarity graph...
Analyzing shared references across papers
Loading...