Show simple item record

Monophonic graphoidal covering number of corona product graphs

dc.creatorTitus, P.
dc.creatorSubha, M.
dc.creatorSantha Kumari, S.
dc.date2023-03-27
dc.date.accessioned2023-05-11T20:42:07Z
dc.date.available2023-05-11T20:42:07Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4781
dc.identifier10.22199/issn.0717-6279-4781
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/225564
dc.descriptionIn a graph G, a chordless path is called a monophonic path. A collection ψm of monophonic paths in G is called a monophonic graphoidal cover of G if every vertex of G is an internal vertex of at most one monophonic path in ψm and every edge of G is in exactly one monophonic path in ψm. The monophonic graphoidal covering number ηm(G) of G is the minimum cardinality of a monophonic graphoidal cover of G. In this paper, we find the monophonic graphoidal covering number of corona product of some standard graphs.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.en-US
dc.relationhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4781/4255
dc.rightsCopyright (c) 2023 P. Titus, M. Subha, S. Santha Kumarien-US
dc.rightshttps://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 42 No. 2 (2023); 303-318en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 42 Núm. 2 (2023); 303-318es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2023-02
dc.subjectgraphoidal coveren-US
dc.subjectmonophonic pathen-US
dc.subjectmonophonic graphoidal coveren-US
dc.subjectmonophonic graphoidal covering numberen-US
dc.subject05Cen-US
dc.titleMonophonic graphoidal covering number of corona product graphsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typePeer-reviewed Articleen-US
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record