On equitable coloring of book graph families
| dc.contributor.author | Barani, M. | |
| dc.contributor.author | M., Venkatachalam | |
| dc.contributor.author | Rajalakshmi, K. | |
| dc.contributor.department | Other | tr_TR |
| dc.contributor.faculty | Other | tr_TR |
| dc.date.accessioned | 2021-11-29T11:00:56Z | |
| dc.date.available | 2021-11-29T11:00:56Z | |
| dc.date.issued | 2020-12-31 | |
| dc.description.abstract | A proper vertex coloring of a graph is equitable if the sizes of color classes differ by atmost one. The notion of equitable coloring was introduced by Meyer in 1973. A proper h − colorable graph K is said to be equitably h-colorable if the vertex sets of K can be partioned into h independent color classes V 1 , V 2 , . . . , V h such that the condition ∣ ∣ | V i | − ∣ ∣ V j ∣ ∣ ∣ ∣ ≤ 1 holds for all different pairs of i and j and the least integer h is known as equitable chromatic number of K . In this paper, we find the equitable coloring of book graph, middle, line and central graphs of book graph. | tr_TR |
| dc.description.index | Trdizin | tr_TR |
| dc.identifier.endpage | 1234 | tr_TR |
| dc.identifier.issn/e-issn | 2618-6470 | |
| dc.identifier.issue | 2 | tr_TR |
| dc.identifier.startpage | 1228 | tr_TR |
| dc.identifier.uri | https://doi.org/10.31801/cfsuasmas.769094 | tr_TR |
| dc.identifier.uri | http://hdl.handle.net/20.500.12575/76416 | |
| dc.identifier.volume | 69 | tr_TR |
| dc.language.iso | en | tr_TR |
| dc.publisher | Ankara Üniversitesi Fen Fakültesi | tr_TR |
| dc.relation.isversionof | 10.31801/cfsuasmas.769094 | 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 | Book graph | tr_TR |
| dc.subject | Middle graph | tr_TR |
| dc.title | On equitable coloring of book graph families | tr_TR |
| dc.type | Article | tr_TR |