IJPAM: Volume 115, No. 5 (2017)
Title
MINIMUM DOM STRONG DOMINATING ENERGYOF GRAPH
Authors
S. Meenakshi


Vels University
Chennai, 600117, Tamil Nadu, INDIA

Bharathi Women's College
Chennai, 600108, Tamil Nadu, INDIA
Abstract
Let

History
Received: April 29, 2017
Revised: May 23, 2017
Published: July 16, 2017
AMS Classification, Key Words
AMS Subject Classification:
Key Words and Phrases: adjacency matrix, dominating set, dom strong dominating set
Download Section
Download paper from here.You will need Adobe Acrobat reader. For more information and free download of the reader, see the Adobe Acrobat website.
Bibliography
- 1
- C. Adiga, A. Bayad, J.Gutman, S.A. Srinivas, The minimum covering energy of a graph, Kragujevac J. Sci., 34 (2012), 39-56.
- 2
- Bo Zhou and Ivan Gutman, On Laplacian energy of graphs, MATCH comm. Math Comput Chem., 57 (2007), 211-220.
- 3
- Bo Zhou, I. Gutman, T. Aleksic, A note on Laplacian energy of graphs, MATCH Commun. Math. Comput. Chem., 60 (2008), 441-446.
- 4
- I. Gutman, The energy of a graph, Ber. Math Statist. Sekt. Forschungsz. Graz., 103 (1978), 1-22.
- 5
- I. Gutman, B. Zhou, Laplacian energy of a graph, Lin. Algebra Appl., 414 (2006), 29-37.
- 6
- I. Gutman, Comparative study of graph energies ,presented at the 8th meeting, held on December 23, (2011).
- 7
- P. Namasivayam, Studies in strong double domination in graphs, Ph.D. thesis, Manonmaniam Sundaranar University, Tirunelveli, India (2008).
How to Cite?
DOI: 10.12732/ijpam.v115i5.5 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: 2017
Volume: 115
Issue: 5
Pages: 1039 - 1047
Google Scholar; DOI (International DOI Foundation); WorldCAT.
This work is licensed under the Creative Commons Attribution International License (CC BY).