On achromatic number of central graph of some graphs
| dc.contributor.author | Nithyadevi, N. | |
| dc.contributor.author | Vijayalakshmi, D. | |
| dc.contributor.department | Other | tr_TR |
| dc.contributor.faculty | Other | tr_TR |
| dc.date.accessioned | 2021-11-04T06:24:33Z | |
| dc.date.available | 2021-11-04T06:24:33Z | |
| dc.date.issued | 2019-08-01 | |
| dc.description.abstract | The concept of coloring a graph will lead to the definition of a complete n- coloring of a graph G which results the achromatic number ψ(G) where the maximum number of colors required for the points of G in which every pair of colors appears on at least one pair of adjacent vertices. In this paper, we obtain the achromatic number for the Central graph of Ladder graph, Central graph of Dutch-Windmill graph, Central graph of Fan graph and Central graph of Flower graph is denoted as ψ[C(L_{n})], ψ[C(D₃⁽ⁿ⁾)], ψ[C(F_{m,n})] and ψ[C(FL_{n})] respectively. | tr_TR |
| dc.description.index | Trdizin | tr_TR |
| dc.identifier.endpage | 1272 | tr_TR |
| dc.identifier.issn/e-issn | 2618-6470 | |
| dc.identifier.issue | 2 | tr_TR |
| dc.identifier.startpage | 1265 | tr_TR |
| dc.identifier.uri | https://doi.org/10.31801/cfsuasmas.517878 | tr_TR |
| dc.identifier.uri | http://hdl.handle.net/20.500.12575/75877 | |
| dc.identifier.volume | 68 | tr_TR |
| dc.language.iso | en | tr_TR |
| dc.publisher | Ankara Üniversitesi Fen Fakültesi | tr_TR |
| dc.relation.isversionof | 10.31801/cfsuasmas.517878 | tr_TR |
| dc.relation.journal | Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics | tr_TR |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | tr_TR |
| dc.subject | Achromatic coloring | tr_TR |
| dc.subject | Achromatic number | tr_TR |
| dc.subject | Central graph | tr_TR |
| dc.title | On achromatic number of central graph of some graphs | tr_TR |
| dc.type | Article | tr_TR |