Graph energy is an important concept in spectral graph theory with applications in mathematics and chemistry. In this paper, we study the Laplacian minimum domination energy of derived graphs of some standard graphs. The main aim is to obtain formulas, properties, and bounds for this energy measure. The study considers derived graphs of star graphs, complete bipartite graphs, friendship graphs, and healthy spider graphs. Using minimum dominating sets, minimum domination adjacency matrices, and Laplacian minimum domination matrices, the eigenvalues of these derived graphs are determined. Based on these eigenvalues, explicit formulas for the Laplacian minimum domination energy are obtained. Further, some basic properties related to eigenvalues are established. Upper and lower bounds for the Laplacian minimum domination energy are also derived using matrix methods and classical inequalities such as the Cauchy-Schwarz inequality. The results extend existing work on graph energy by combining domination concepts, Laplacian matrices, and derived graphs. The formulas, properties, and bounds obtained in this paper provide a better understanding of the spectral behavior of derived graphs and may be useful for further research in graph theory and its applications.
| Published in | American Journal of Applied Mathematics (Volume 14, Issue 4) |
| DOI | 10.11648/j.ajam.20261404.14 |
| Page(s) | 210-219 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2026. Published by Science Publishing Group |
Laplacian Minimum Domination Derived Matrix, Laplacian Minimum Domination Derived Eigenvalues, Laplacian Minimum Domination Energy
| [1] | A. S. Ashwini, H. Ahmed, N. D. Soner, On Domination Zagreb Polynomials Of Graphs and Some Graph Operations, International Journal of Mathematics Trends and Technology, 68(2), (2022), 66-74. |
| [2] | R. Balakrishna, The Energy of Graph, Linear Algebra and It's Applications, 387, (2004), 287-295. |
| [3] | D. Cvetkovic, I.Gutman, Applications of Graph Spectra, Mathematical Institution, Belgrade, (2009). |
| [4] | D. Cvetkovic, I.Gutman, Selected Topics on Applications of Graph Spectra, Mathematical Institution, Belgrade, (2011). |
| [5] | Dragos M. Cvetkovic, Spectra of Graph Theory and Applications, 1980. |
| [6] | I. Gutman, The Energy of Graph; Old and New Results, Algebraic Combinations and Applications, Springer, (2001), 196-211. |
| [7] | I. Gutman, The Energy of a Graph, Ber. Math-Statist. Sekt. Forschu. Graz., 103, (1978), 1-22. |
| [8] | I.Gutman and O.E. Polansky, Mathematical Concepts in Organic Chemistry, Springer, Berlin, (1986). |
| [9] | I.Gutman and B. Zhou, Laplacian energy of a graph, Linear Algebra and its Applications, 414, (2006), 29-37. |
| [10] | F. Harary, Graphs Theory, Addison-Wisley Publishing co., Reading Mass, (1969). |
| [11] | Jack H. Koolen, Vincent Moulton, Maximal Energy of Graphs, Advance in Applied Mathematics, 26(1), (2001), 47-52. |
| [12] | McClelland, B.J, Properties of the latent roots of a matrix: The estimation of π electron energies, J. Chem. Phys., 54, (1971), 640-643. |
| [13] | Meena S, vaithilingam K, prime Labeling of Friendship Graphs, IJERT, 1(10), (2012), 1-13. |
| [14] | Rajesh Kanna M. R, Jagadeesh R, Mohammad Reza Farahani, Minimum Covering Seidel Energy of a Graph, J. indones. Math. Soc, 22(1), (2016), 71-82. |
| [15] | Saieed Akbani, Shahab Hanghi, Hamidreza Maimani, abbas Seify, On double-Star Decomposition of Graph, Discussion Mathematicae, 37, (2017), 835-840. |
| [16] | Solairaniravindra P. Bapat, Graphs and Matrices, Springer, 27, 2010. |
| [17] | Sudhir R. Jog, Satish P. Hande, I. Gutman, S. Burch Bozkurt, Derived graphs of Some Graphs, Kragujevac Journal of Mathematics, 32(2), (2012), 309-314. |
APA Style
Rajanna, J., Shashidhara, A. A. (2026). Laplacian Minimum Domination Energy of Some Derived Graphs. American Journal of Applied Mathematics, 14(4), 210-219. https://doi.org/10.11648/j.ajam.20261404.14
ACS Style
Rajanna, J.; Shashidhara, A. A. Laplacian Minimum Domination Energy of Some Derived Graphs. Am. J. Appl. Math. 2026, 14(4), 210-219. doi: 10.11648/j.ajam.20261404.14
@article{10.11648/j.ajam.20261404.14,
author = {Jagadeesh Rajanna and Ashwini Ankanahalli Shashidhara},
title = {Laplacian Minimum Domination Energy of Some Derived Graphs},
journal = {American Journal of Applied Mathematics},
volume = {14},
number = {4},
pages = {210-219},
doi = {10.11648/j.ajam.20261404.14},
url = {https://doi.org/10.11648/j.ajam.20261404.14},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajam.20261404.14},
abstract = {Graph energy is an important concept in spectral graph theory with applications in mathematics and chemistry. In this paper, we study the Laplacian minimum domination energy of derived graphs of some standard graphs. The main aim is to obtain formulas, properties, and bounds for this energy measure. The study considers derived graphs of star graphs, complete bipartite graphs, friendship graphs, and healthy spider graphs. Using minimum dominating sets, minimum domination adjacency matrices, and Laplacian minimum domination matrices, the eigenvalues of these derived graphs are determined. Based on these eigenvalues, explicit formulas for the Laplacian minimum domination energy are obtained. Further, some basic properties related to eigenvalues are established. Upper and lower bounds for the Laplacian minimum domination energy are also derived using matrix methods and classical inequalities such as the Cauchy-Schwarz inequality. The results extend existing work on graph energy by combining domination concepts, Laplacian matrices, and derived graphs. The formulas, properties, and bounds obtained in this paper provide a better understanding of the spectral behavior of derived graphs and may be useful for further research in graph theory and its applications.},
year = {2026}
}
TY - JOUR T1 - Laplacian Minimum Domination Energy of Some Derived Graphs AU - Jagadeesh Rajanna AU - Ashwini Ankanahalli Shashidhara Y1 - 2026/07/17 PY - 2026 N1 - https://doi.org/10.11648/j.ajam.20261404.14 DO - 10.11648/j.ajam.20261404.14 T2 - American Journal of Applied Mathematics JF - American Journal of Applied Mathematics JO - American Journal of Applied Mathematics SP - 210 EP - 219 PB - Science Publishing Group SN - 2330-006X UR - https://doi.org/10.11648/j.ajam.20261404.14 AB - Graph energy is an important concept in spectral graph theory with applications in mathematics and chemistry. In this paper, we study the Laplacian minimum domination energy of derived graphs of some standard graphs. The main aim is to obtain formulas, properties, and bounds for this energy measure. The study considers derived graphs of star graphs, complete bipartite graphs, friendship graphs, and healthy spider graphs. Using minimum dominating sets, minimum domination adjacency matrices, and Laplacian minimum domination matrices, the eigenvalues of these derived graphs are determined. Based on these eigenvalues, explicit formulas for the Laplacian minimum domination energy are obtained. Further, some basic properties related to eigenvalues are established. Upper and lower bounds for the Laplacian minimum domination energy are also derived using matrix methods and classical inequalities such as the Cauchy-Schwarz inequality. The results extend existing work on graph energy by combining domination concepts, Laplacian matrices, and derived graphs. The formulas, properties, and bounds obtained in this paper provide a better understanding of the spectral behavior of derived graphs and may be useful for further research in graph theory and its applications. VL - 14 IS - 4 ER -