Research Article
Connected Edge Monophonic Domination Number of a Graph
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 145 - Issue 12 |
| Published: Jul 2016 |
| Authors: P. Arul Paul Sudhahar, M. Mohammed Abdul Khayyoom, A. Sadiquali |
10.5120/ijca2016910759
|
P. Arul Paul Sudhahar, M. Mohammed Abdul Khayyoom, A. Sadiquali . Connected Edge Monophonic Domination Number of a Graph. International Journal of Computer Applications. 145, 12 (Jul 2016), 18-21. DOI=10.5120/ijca2016910759
@article{ 10.5120/ijca2016910759,
author = { P. Arul Paul Sudhahar,M. Mohammed Abdul Khayyoom,A. Sadiquali },
title = { Connected Edge Monophonic Domination Number of a Graph },
journal = { International Journal of Computer Applications },
year = { 2016 },
volume = { 145 },
number = { 12 },
pages = { 18-21 },
doi = { 10.5120/ijca2016910759 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2016
%A P. Arul Paul Sudhahar
%A M. Mohammed Abdul Khayyoom
%A A. Sadiquali
%T Connected Edge Monophonic Domination Number of a Graph%T
%J International Journal of Computer Applications
%V 145
%N 12
%P 18-21
%R 10.5120/ijca2016910759
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In this paper the concept of connected edge monophonic domination number of a graph is introduced. A set of vertices M of a graph G is a connected edge monophonic domination set (CEMD set) if it is edge monophonic set, a domination set of G and the induced sub graph is connected. The connected edge monophonic domination number (CEMD number) of G, γmce (G) is the cardinality of a minimum CEMD set. CEMD number of some connected graphs are realized. Connected graphs of order n with CEMD number n are characterised.It is shown that for every pair of integers m and n such that 3 ≤ m ≤ n, there exist a connected graph G of order n with γmce (G) = m. Also, for any positive integers p,q and r there is a connected graph G such that m(G)= p,me(G)= q and γmce (G) =r. Again, for any connected graph G, γmce (G) lies between n/(1+∆(G)) and n.
References
- P. Arul Paul Sudhahar, M Mohammed Abdul Khayyoom and A Sadiquali. Edge Monophonic Domination Number of Graphs. J. Adv. in Mathematics. Vol 11. 10 pp 5781-5785 (Jan 2016)
- P Arul Paul Sudhahar, M Mohammed Abdul Khayyoom and A Sadiquali. Connected closed monophonic number of graphs. Indian J. Res. Found., (2016) 5, 17-21.
- P. Arul Paul Sudhahar, A. Sadiquali and M Mohammed Abdul Khayyoom. The Monophonic Geodetic Domination Number of Graphs. J. Comp. Math. Sci. Vol 7(1). Pp 27-38 (Jan 2016)
- F.Buckley, and F.Harary. Distance in Graphs, Addition Wesley, Redwood City, CA (1990):
- Gary Chartrand and P.Zhang. Introduction to Graph Theory. Mac Graw Hill (2005)
- T W Haynes, S.T Hedetniemi and P.J Slater, Fundementals of Domination in Graphs,208, Marcel Dekker Inc, New York,1998
- J. Jhon and P.Arul Paul Sudhahar. On The Edge Monophonic Number of a Graph. Filomat. Vol.26.6 pp 1081-1089(2012).
- J. Jhon and P.Arul Paul Sudhahar. The Monophonic Domination Number of a Graph. Proceedings of the International Conference on Mathematics and Business Management. (2012) pp 142-145.
- J.Jhon and P.Arul Paul Sudhahar. The Connected Edge Monophonic Number of a Graph. J. Comp. and Math. Sci. Vol 3(2), 131-136 (2012)
- A.P Santhakumaran, P. Titus and R. Ganesamoorthy.On The Monophonic Number of a Graph Applied Math and Informatics. Vol 32,pp 255-266 (2014).
Index Terms
Keywords