Distance energy of partial complementary graph
Abstract
The partial complement of a graph G with respect to a set S is the graph obtained from G by removing the edges of induced subgraph and adding edges which are not in of G. In this paper we introduce the concept of distance energy of connected partial complements of a graph. Few properties on distance eigenvalues and bounds for distance energy of connected partial complement of a graph are achieved. Further distance energy of connected partial complement of some families of graphs are computed.
Copyright © 2020 Sabitha D’Souza, Swati Nayak, H. J. Gowtham, Pradeep G. Bhat. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
S. D’Souza, S. Nayak, H. J. Gowtham, P. G. Bhat, Distance energy of partial complementary graph, J. Math. Comput. Sci. 10 (2020), 1590–1606. https://doi.org/10.28919/jmcs/4581
BibTeX
@article{D’Souza2020,
author = {D’Souza, Sabitha and Nayak, Swati and Gowtham, H. J. and Bhat, Pradeep G.},
title = {Distance energy of partial complementary graph},
journal = {J. Math. Comput. Sci.},
volume = {10},
year = {2020},
pages = {1590--1606},
doi = {10.28919/jmcs/4581}
}