MINIMUM DOMINATING DISTANCE ENERGY OF A GRAPH
| Main Authors: | kanna, rajesh; Post Graduate Department of Mathematics, Maharanis Science College for Women, Mysore 570005, Karnataka, India./, B N, DHARMENDRA; Post Graduate Department of Mathematics, Maharanis Science College for Women, Mysore 570005, Karnataka, India., G, SRIDHARA; Post Graduate Department of Mathematics, Maharanis Science College for Women, Mysore 570005, Karnataka, India. |
|---|---|
| Format: | Article application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
IndoMS
, 2014
|
| Subjects: | |
| Online Access: |
http://www.jims-a.org/index.php/jimsa/article/view/133 |
Daftar Isi:
- Recently we introduced the concept of minimum dominating energy[21]. Motivatedby this paper,we introduced the concept of minimum dominating distance energyEDd(G) of a graph G and computed minimum dominating distance energies of a Stargraph,Complete graph,Crown graph and Cocktail graphs. Upper and lower boundsfor EDd(G) are also established.DOI : http://dx.doi.org/10.22342/jims.20.1.133.19-29