| dc.creator | Santhakumaran, A. P. | |
| dc.creator | Titus, P. | |
| dc.creator | Balakrishnan, P. | |
| dc.date | 2013-09-01 | |
| dc.identifier | http://www.revistaproyecciones.cl/article/view/1308 | |
| dc.identifier | 10.4067/S0716-09172013000300002 | |
| dc.description | For a connected graph G of order n,a set S of vertices is called an edge monophonic set of G if every edge of G lies on a monophonic path joining some pair of vertices in S, and the edge monophonic number me(G) is the minimum cardinality of an edge monophonic set. An edge monophonic set S of G is a connected edge mono-phonic set if the subgraph induced by S is connected, and the connected edge monophonic number mce(G) is the minimum cardinality of a connected edge monophonic set of G. Graphs of order n with connected edge monophonic number 2, 3 or n are characterized. It is proved that there is no non-complete graph G of order n > 3 with me(G) = 3 and mce(G)= 3. It is shown that for integers k,l and n with 4 < k < l < n, there exists a connected graph G of order n such that me(G) = k and mce(G) = l.Also, for integers j,k and l with 4 < j < k < l, there exists a connected graph G such that me(G)= j,mce(G)= k and gce(G) = l,where gce(G) is the connected edge geodetic number ofa graph G. | es-ES |
| dc.format | application/pdf | |
| dc.language | spa | |
| dc.publisher | Universidad Católica del Norte. | es-ES |
| dc.relation | http://www.revistaproyecciones.cl/article/view/1308/1020 | |
| dc.rights | Derechos de autor 2013 Proyecciones. Journal of Mathematics | es-ES |
| dc.source | Proyecciones. Journal of Mathematics; Vol 32 No 3 (2013); 215-234 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 32 Núm. 3 (2013); 215-234 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 0716-0917 | |
| dc.title | Connected edge monophonic number of a graph | es-ES |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Artículo revisado por pares | es-ES |
