Bound inequalities on minimum covering energy of graphs
Resumen
The sum of the absolute values of all Minimum Covering eigenvalues $E_{mc}\mathfrak{(G)}$, of graph $\mathfrak{G}$ represents the Minimum Covering energy of that graph. A few upper and lower constraints on the minimum Covering energy are obtained in this study.
Descargas
Citas
C. Adiga, Abdelmejid Bayad, Ivan Gutman and Shrikanth A S, The Minimum Covering Energy of a Graph, Kragujevac J. Sci.Vol. 4, (8),(2009) 385 - 396.
C. Adiga and Smitha M ,On Maximum degree energy of a Graph, Int. J. Contemp. Math. Sciences,Vol. 4, 34,(2012).
E.Hükel, Quantentheoretische Beiträge zum Benzolproblem I. Die Elektronenkonfiguration des Benzols und verwandter Vebindungen. Z.phys.70 (1931) 204-286
S.S.Dragomir, A survey on cauchy-Bunyakovsky-Schwarz type discreate inequalities, J.Inequal.Pure Appl.Math.4 (2003), no. 3,1-142.
I. Gutman, The energy of a graph, Ber. Math. Stat. Sekt. Forschungsz. Graz, 103(1978), 1-22.
I. Gutman and B.Jhou, Laplacian energy of a Graph, Lin. Algebra Appl,414 (2006), 29-37. The energy of a graph, Ber. Math. Stat. Sekt. Forschungsz. Graz, 103(1978), 1-22.
bibitemhu
G.Indulal,I.Gutman, A.Vijaykumar, On distance energy of Graphs, MATCH Commun. Math.Comput.Chem.60(2008) 355-372.
M R Jooyandeh, D.Kiani, M.Mirzakhah,Incidence energy of Graph, MATCH Commun. Math.Comput.Chem. bf60(2008) 561-572.
Mohammad Reza Oboudi, A new lower bound for the energy of graphs, Lin. Algebra Appl,580 (2019),381-395.
Derechos de autor 2025 Boletim da Sociedade Paranaense de Matemática

Esta obra está bajo licencia internacional Creative Commons Reconocimiento 4.0.
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).



