Minimum Pendant Dominating Partition Energy of a Graph

M N Prakasha; Puttaswamy; S Purushothama; S R Nayaka

doi:10.17485/IJST/v16i37.1819

Article

Minimum Pendant Dominating Partition Energy of a Graph

VIEWS 321
PDF 73

Indian Journal of Science and Technology

DOI: 10.17485/IJST/v16i37.1819

Year: 2023, Volume: 16, Issue: 37, Pages: 3159-3167

Original Article

Minimum Pendant Dominating Partition Energy of a Graph

M N Prakasha¹, Puttaswamy¹, S Purushothama^2*, S R Nayaka¹

¹Department of Mathematics, PESCE, Mandya, Visvesveraya Technological University, Belagavi, 590018, India
²Department of Mathematics, MIT Mysore, Mandya, Visvesveraya Technological University, Belagavi, 590018, India

*Corresponding Author
Email: [email protected]

Received Date:04 August 2023, Accepted Date:03 September 2023, Published Date:09 October 2023

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

Abstract

Objectives: To define and study the minimum pendant dominating partition energy of some standard graphs. Further we also establish upper and lower bounds for minimum pendant dominating partition energy of a graph G. Methods: To establish the upper and lower bounds for the energy of graphs we employ the Standard methods of proofs namely direct methods and using Matlab to compute the minimum pendant dominating partition eigen values of a graph G. Findings: In this paper we calculated the minimum pendant dominating partition energy of some standard family of graphs and also find the properties of minimum pendant dominating partition eigen values of of G. Some bounds are established. Novelty: In this article we found some interesting properties of minimum pendant dominating partition eigen values.

Keywords: Dominating set; Pendant Dominating set; Minimum Pendant Dominating set; Partition Energy; Minimum Partition Energy

References

Gutman I. The Energy of a Graph: Old and New Results. In: Algebraic Combinatorics and Applications. (pp. 196-211) Springer Berlin Heidelberg. 2001.
Nayaka SR, Purushothama P, S. Pendant Domination in Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing. 2020;112:219–230. Available from: https://www.researchgate.net/publication/342158953_PENDANT_DOMINATION_IN_GRAPHS
Nayaka SR, Puttaswamy, Purushothama S. Pendant domination in generalized graphs. International Journal of Scientific Engineering and Science. 2017;1(7):2456–7361. Available from: https://www.researchgate.net/publication/339644820_Pendant_Domination_in_Some_Generalised_Graphs
Sriraj MA, Shwetha BC, Veena CR, Roopa SV. Partition energy of some lexicographic product of two graphs. Proceedings of the Jangjeon Mathematical Society. 2022;25(4):435–454. Available from: http://dx.doi.org/10.17777/pjms2022.25.4.435
Kanna1 MRR, Dharmendra BN, Sridhara G. Minimum Dominating Energy of a Graph. International Journal of Pure and Applied Mathematics. 2013;85(4):1314–3395. Available from: http://dx.doi.org/10.12732/ijpam.v85i4.7
Purushothama S, Puttaswamy, Nayaka SR. Minimum Pendant Dominating Energy of a Graph. American International Journal of Research in Science. 2019;p. 2328–3629. Available from: https://www.researchgate.net/publication/335291794_MINIMUM_PENDANT_DOMINATING_ENERGY_OF_A_GRAPH

Copyright

© 2023 Prakasha et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Published By Indian Society for Education and Environment (iSee)