Show simple item record

On the (M,D) number of a graph.

dc.creatorJohn, J.
dc.creatorSudhahar, P. Arul Paul
dc.creatorStalin, D.
dc.date2019-05-30
dc.date.accessioned2019-06-28T17:07:08Z
dc.date.available2019-06-28T17:07:08Z
dc.identifierhttp://www.revistaproyecciones.cl/article/view/3570
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/101166
dc.descriptionFor a connected graph G = (V, E), a monophonic set of G is a set M ⊆ V (G) such that every vertex of G is contained in a monophonic path joining some pair of vertices in M. A subset D of vertices in G is called dominating set if every vertex not in D has at least one neighbour in D. A monophonic dominating set M is both a monophonic and a dominating set. The monophonic, dominating, monophonic domination number m(G), γ(G), γm(G) respectively are the minimum cardinality of the respective sets in G. Monophonic domination number of certain classes of graphs are determined. Connected graph of order p with monophonic domination number p− 1 or p is characterised. It is shown that for every two intigers a, b ≥ 2 with 2 ≤ a ≤ b, there is a connected graph G such that γm(G) = a and γg(G) = b, where γg(G) is the geodetic domination number of a graph.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttp://www.revistaproyecciones.cl/article/view/3570/3167
dc.rightsDerechos de autor 2019 Proyecciones. Revista de Matemáticaes-ES
dc.rightshttp://creativecommons.org/licenses/by-nc/4.0es-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 38 No 2 (2019); 255-266en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 38 Núm. 2 (2019); 255-266es-ES
dc.source0717-6279
dc.source0716-0917
dc.titleOn the (M,D) number of a graph.en-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record