NEW LIMITS ON DOMINATING SETS' ENERGY SUM IN PARTICULAR GRAPHS

Authors

  • N. Anbarasi Department of Mathematics, SDNB Vaishnav College for Women, Chennai,600045, India
  • S. Hemalatha Department of Mathematics, SDNB Vaishnav College for Women, Chennai,600045, India
  • K. Anitha Department of Mathematics, Sri Sairam Engineering College, Chennai, 600045, India

DOI:

https://doi.org/10.29121/shodhkosh.v5.i5.2024.4717

Keywords:

Domination Number, Adjacency Matrix, Dominant Matrix, Eigen Values, Energy Sum

Abstract [English]

The energy sum of a dominating subset of connected & undirected graphs was investigated in this article. A graph Ġ = (X, Y) consists of edges & vertices, which are known as nodes. A subset in a graph's nodes is known as the dominant set Ð; every node in the graph is either within Ð or is adjacent in Ð. The dominating number of network Ġ, abbreviated as γ(Ġ), is the least cardinality for the dominant set. The energy of a simple, connected graph Ġ is calculated by adding its absolute eigen values. The eigen value of a graph's dominating matrix Ð(Ġ) is it's eigen value. In this article, we utilized code for MATLAB and a strategy to investigate the bounds of the energy sum using the dominating matrix.

References

Balakrishnan R, Ranganathan K,(2000). Springer, New York, A Textbook of Graph Theory. DOI: https://doi.org/10.1007/978-1-4419-8505-7

Balakrishnan R,(2004). Linear Algebra and its Applications, The energy of a graph: Volume 387, 287-295. DOI: https://doi.org/10.1016/j.laa.2004.02.038

Ivan Gutman,(2001). Algebraic Combinatorics and Applications, Springer, The energy of a graph: Old and new results, 196–211. DOI: https://doi.org/10.1007/978-3-642-59448-9_13

Ivan Gutman, Boris Furtula, (2019), Bulletin T. CLII de l’Acad´emie serbe des sciences et des arts − 2019 Classe des Sciences math´ematiques et naturelles Sciences math´ematiques, presented at the 6th Meeting, Graph Energies and Their Applications.

Sophia Shalini G. B. Mayamma Joseph, (2017). Global Journal of Pure and Applied Mathematics, New Results on Energy of Graphs of Small Order, Volume 13, Number 7, 2837-2848.

Kamal Kumar M, Johnson Jahan Jayersy, Winson R, (2018), International Journal of Mathematics and Combinatorics, Different Domination Energies in Graphs: Vol. 4, 103-145.

West D B, (2014). PHI Learning pvt. ltd., Introduction to Graph Theory, 2nd ed., New Delhi.

Kamal Kumar M, (2012), International Journal Applied Mathematics, Domination Energy of Some Well - known Graphs, 417-424.

Nikiforov V, (2007), Journal of Mathematical Analysis and Applications, The Energy of graphs and Matrices, 1472-1475. DOI: https://doi.org/10.1016/j.jmaa.2006.03.072

Haynes T.W., HedetniemI S.T., Henning, M.A. (2023), Core Concepts Springer Monographs in Mathematics. Springer, Cham, Domination in Graphs, 129–208. DOI: https://doi.org/10.1007/978-3-031-09496-5_6

Berge C, (1958) Dunod, Paris, Theory of graphs and its applications.

Zmazek B, Zerovnik J, (2005), Institute of mathematics, Physics and mechanics, On domination numbers of graph bundles.

Downloads

Published

2024-05-31

How to Cite

N. Anbarasi, S. Hemalatha, & K. Anitha. (2024). NEW LIMITS ON DOMINATING SETS’ ENERGY SUM IN PARTICULAR GRAPHS. ShodhKosh: Journal of Visual and Performing Arts, 5(5), 908–917. https://doi.org/10.29121/shodhkosh.v5.i5.2024.4717