Minimum Dominating Partition Energy of a Graph


Abstract views: 31 / PDF downloads: 31

Authors

  • R. Pradeep Kumar Research Scholar, University of Mysuru, Mysuru, Karnataka, India
  • D. Soner Nandappa Department of Mathematics, University of Mysore, Mysuru, Karnataka, India
  • M. R. Rajesh Kanna Department of Mathematics, Sri D Devaraj Urs Government First Grade College, Hunsur, Karnataka, India

Keywords:

Minimum dominating set, Minimum dominating partition matrix, Minimum dominating partition eigenvalues, Minimum dominating partition energy of a graph

Abstract

In this paper we compute minimum dominating partition energies of a star graph, complete graph, crown graph and cocktail party graphs. We also establish upper and lower bounds for minimum dominating partition energy $PE_{D}(G)$ of a graph $G$.

Downloads

Published

30-12-2017

How to Cite

R. Pradeep Kumar, D. Soner Nandappa, & M. R. Rajesh Kanna. (2017). Minimum Dominating Partition Energy of a Graph. International Journal of Mathematics And Its Applications, 5(4 - F), 857–865. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/1349

Issue

Vol. 5 No. 4 - F (2017)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.