Abstract
Partial complement of a graph G with respect to a set S is a graph obtained from G by removing edges of 〈S〉 and adding the edges which are not in 〈S〉 In this article, we obtain partial complement energy and partial complement characteristic polynomial of few classes of graph
Original language | English |
---|---|
Article number | IJCS_49_2_27 |
Journal | IAENG International Journal of Computer Science |
Volume | 49 |
Issue number | 2 |
Publication status | Published - 2022 |
All Science Journal Classification (ASJC) codes
- Computer Science(all)