Distance energy of partial complementary graph

Sabitha D’Souza, Swati Nayak, H. J. Gowtham, Pradeep G. Bhat

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 <Si> and adding edges which are not in <Si> 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.

Full Text: PDF

Published: 2020-06-22

How to Cite this Article:

Sabitha D’Souza, Swati Nayak, H. J. Gowtham, Pradeep G. Bhat, Distance energy of partial complementary graph, J. Math. Comput. Sci., 10 (2020), 1590-1606

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.

J. Math. Comput. Sci.

ISSN: 1927-5307

Editorial Office: jmcs@scik.org

 

Copyright ©2020 JMCS