Home / Current Issue / Paper 1700677
Minimum Inverse Dominating Energy Of A Graph
Subject area: Science,Engineering and Technology · Area of research: Mathematics
Abstract
The Partition Laplacian energy of a graph was introduced by K. N Prakasha. In this paper, by the motivation of this energy, the Minimum Inverse Dominating energy ED' (G) of a graph is introduced and the ED' (G) of some important graph classes is discussed.
Keywords
minimum inverse dominating set, minimum inverse dominating matrix, minimum inverse dominating eigen values, minimum inverse dominating energy of a graph.
References
[1] I. Gutman, The energy of a graph, Ber. Math- Statist. Sekt. Forschungsz Graz, 103 (1978), 1- 22.
[2] F. Harary, Graph Theory, Addison-Wesley Publishing Co., (1969).
[3] K. N. Prakasha, P Siva Kota Reddy, Ismail Naci Cangul, Partition Laplacian, Advanced Studies in Contemporary Mathematics, 27 (2017), No. 4, pp. 477 – 494.
[4] V. R. Kulli and S.C.Sigarkanti, Inverse domination in graphs, Nat. Acad. Sci . Letters, Vol. 14, 1991, 473-475.
How to cite this paper
@article{1700677,
author = {K. N. Prakasha, Kavita Permi},
title = {Minimum Inverse Dominating Energy Of A Graph},
journal = {Iconic Research And Engineering Journals},
year = {2018},
volume = {1},
number = {11},
pages = {10-13},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1700677.pdf},
abstract = {The Partition Laplacian energy of a graph was introduced by K. N Prakasha. In this paper, by the motivation of this energy, the Minimum Inverse Dominating energy ED' (G) of a graph is introduced and the ED' (G) of some important graph classes is discussed.},
keywords = {minimum inverse dominating set, minimum inverse dominating matrix, minimum inverse dominating eigen values, minimum inverse dominating energy of a graph.},
month = {May},
}