Research ArticleOpen AccessGoogle Scholar indexed
Minimum Covering Randić Energy of a Graph
Department of Mathematics, Government First Grade College, Puttur, India
Research and Development Centre, Bharathiar University, Coimbatore, India
Department of Mathematics, Maharani’s Science College for Women, Mysore, India
- 1 Department of Mathematics, Government First Grade College, Puttur, India
- 2 Research and Development Centre, Bharathiar University, Coimbatore, India
- 3 Department of Mathematics, Maharani’s Science College for Women, Mysore, India
Advances in Linear Algebra & Matrix Theory·Volume 06 (2016)·Pages 116–131·Published 28 November 2016·DOI10.4236/alamt.2016.64012
Copy link · social · email
Abstract
Randić energy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randić energy RE C ( G ) of a graph G in this paper. This paper contains computation of minimum covering Randić energies for some standard graphs like star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship graphs. At the end of this paper, upper and lower bounds for minimum covering Randić energy are also presented.
KeywordsMinimum Covering SetMinimum Covering Randi&cacuteMatrixMinimum Covering Randi&cacuteEigenvaluesMinimum Covering Randi&cacuteEnergy
- Bozkurt, S.B., Güngör, A.D. and Gutman, I. (2010) Randić Spectral Radius and Randić Energy. Communications in Mathematical and in Computer Chemistry, 64, 239-250.
- Gutman, I. (1978) The Energy of a Graph. Ber. Math-Statist. Sekt. Forschungsz. Graz, 103, 1-22.
- Gutman, I., Li, X. and Zhang, J. (2009) Graph Energy. In: Dehmer, M. and Emmert-Streib, F., Eds., Analysis of Complex Networks. From Biology to Linguistics, Wiley-VCH, Weinheim, 145-174.
- Cvetković, D. and Gutman, I., Eds. (2009) Applications of Graph Spectra. Mathematical Institution, Belgrade.
- Cvetković, D. and Gutman, I., Eds. (2011) Selected Topics on Applications of Graph Spectra. Mathematical Institute Belgrade.
- Gutman, I. (2001) The Energy of a Graph: Old and New Results. In: Betten, A., Kohnert, A., Laue, R. and Wassermann, A., Eds., Algebraic Combinatorics and Applications, Springer, Berlin, 196-211.
- Liu, H.Q., Lu, M. and Tian, F. (2007) Some Upper Bounds for the Energy of Graphs. Journal of Mathematical Chemistry, 41, 45-57. https://doi.org/10.1007/s10910-006-9183-9
- McClelland, B.J. (1971) Properties of the Latent Roots of a Matrix: The Estimation of π - Electron Energies. The Journal of Chemical Physics, 54, 640-643. https://doi.org/10.1063/1.1674889
- Gutman, I. and Polansky, O.E. (1986) Mathematical Concepts in Organic Chemistry. Springer, Berlin. https://doi.org/10.1007/978-3-642-70982-1
- Graovac, A., Gutman, I. and Trinajstić, N. (1977) Topological Approach to the Chemistry of Conjugated Molecules. Springer, Berlin. https://doi.org/10.1007/978-3-642-93069-0
- Randić, M. (1975) On Characterization of Molecular Branching, Journal of the American Chemical Society, 97, 6609-6615. https://doi.org/10.1021/ja00856a001
- Bozkurt, S.B. and Bozkurt, D. (2013) Sharp Upper Bounds for Energy and Randić Energy. Communications in Mathematical and in Computer Chemistry, 70, 669-680.
- Dilek Maden, A. (2015) New Bounds on the Incidence Energy, Randić Energy and Randić Estrada Index. Communications in Mathematical and in Computer Chemistry, 74, 367-387.
- Das, K.Ch., Sorgun, S. and Gutman, I. (2015) On Randić Energy. Communications in Mathematical and in Computer Chemistry, 73, 81-92.