Show simple item record

Grundy number of corona product of some graphs

dc.creatorStella Maragatham, R.
dc.creatorSubramanian, A.
dc.date2023-09-13
dc.date.accessioned2023-09-22T12:43:10Z
dc.date.available2023-09-22T12:43:10Z
dc.identifierhttps://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4962
dc.identifier10.22199/issn.0717-6279-4962
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/234447
dc.descriptionThe Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex u colored with color i, 1 ≤ i ≤ k, is adjacent to i – 1 vertices colored with each color j, 1 ≤ j ≤ i − 1. In this paper we obtain the Grundy number of corona product of some graphs, denoted by G ◦ H. First, we consider the graph G be 2-regular graph and H be a cycle, complete bipartite, ladder graph and fan graph. Also we consider the graph G and H be a complete bipartite graphs, fan 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/4962/4365
dc.rightsCopyright (c) 2023 R. Stella Maragatham, A. Subramanianen-US
dc.rightshttps://creativecommons.org/licenses/by/4.0en-US
dc.sourceProyecciones (Antofagasta, On line); Vol. 42 No. 5 (2023); 1177-1189en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 42 Núm. 5 (2023); 1177-1189es-ES
dc.source0717-6279
dc.source10.22199/issn.0717-6279-2023-05
dc.subjectgrundy numberen-US
dc.subjectcorona producten-US
dc.subject2-regular graphen-US
dc.subjectcycleen-US
dc.subjectcomplete bipartiteen-US
dc.subjectladder graphen-US
dc.subjectfan graphen-US
dc.subject05C15en-US
dc.subject05C75en-US
dc.titleGrundy number of corona product of some graphsen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typetexten-US


This item appears in the following Collection(s)

Show simple item record