IJPAM: Volume 85, No. 4 (2013)

THE MINIMUM DOMINATING ENERGY OF A GRAPH

M.R. Rajesh Kanna1, B.N. Dharmendra2, G. Sridhara3
1,2,3Post Graduate Department of Mathematics
Maharani's Science College for Women
J.L.B. Road, Mysore, 570 005, INDIA
3Research Scholar
Research and Development Centre
Bharathiar University
Coimbatore, 641 046, INDIA


Abstract. Recently Professor Chandrashekar Adiga et al [#!adiga!#] defined the minimum covering energy, EC(G) of a graph which depends on its particular minimum cover C. Motivated by this, we introduced minimum dominating energy of a graph ED(G) and computed minimum dominating energies of a star graph, complete graph, crown graph and cocktail graphs. Upper and lower bounds for ED(G) are established.

Received: January 25, 2013

AMS Subject Classification: 05C50, 05C69

Key Words and Phrases: minimum dominating set, minimum dominating matrix, minimum dominating eigenvalues, minimum dominating energy of a graph

Download paper from here.



DOI: 10.12732/ijpam.v85i4.7 How to cite this paper?
Source:
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2013
Volume: 85
Issue: 4