On equitable chromatic number of Tadpole graph T_{m,n}
| dc.contributor.author | Venkatachalam, M. | |
| dc.contributor.author | Praveena, K. | |
| dc.contributor.department | Other | tr_TR |
| dc.contributor.faculty | Other | tr_TR |
| dc.date.accessioned | 2021-11-05T07:04:07Z | |
| dc.date.available | 2021-11-05T07:04:07Z | |
| dc.date.issued | 2019-08-01 | |
| dc.description.abstract | Graph coloring is a special case of graph labeling. Proper vertex k-coloring of a graph Gis to color all the vertices of a graph with different colors in such a way that no two adjacent vertices are assigned with the same color. In a vertex coloring of G, the set of vertices with the same color is called color class. An equitable k-coloring of a graph G is a proper k-coloring in which any two color classes differ in size by atmost one. In this paper we give results regarding the equitable coloring of central, middle, total and line graphs of Tadpole graph which is obtained by connecting a cycle graph and a path graph with a bridge. | tr_TR |
| dc.description.index | Trdizin | tr_TR |
| dc.identifier.endpage | 1646 | tr_TR |
| dc.identifier.issn/e-issn | 2618-6470 | |
| dc.identifier.issue | 2 | tr_TR |
| dc.identifier.startpage | 1638 | tr_TR |
| dc.identifier.uri | https://doi.org/10.31801/cfsuasmas.546904 | tr_TR |
| dc.identifier.uri | http://hdl.handle.net/20.500.12575/75910 | |
| 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.546904 | 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 | Equitable coloring | tr_TR |
| dc.subject | Tadpole graph | tr_TR |
| dc.subject | Cycle graph | tr_TR |
| dc.title | On equitable chromatic number of Tadpole graph T_{m,n} | tr_TR |
| dc.type | Article | tr_TR |