| dc.contributor.author | Vivik, J. Veninstine | |
| dc.date.accessioned | 2021-11-04T07:47:33Z | |
| dc.date.available | 2021-11-04T07:47:33Z | |
| dc.date.issued | 2019-08-01 | |
| dc.identifier.uri | https://doi.org/10.31801/cfsuasmas.524481 | tr_TR |
| dc.identifier.uri | http://hdl.handle.net/20.500.12575/75880 | |
| dc.description.abstract | The equitable edge chromatic number is the minimum number of colors required to color the edges of a graph G and satisfies the criterion, if for each vertex v∈V(G), the number of edges of any one color incident with v differs from the number of edges of any other color incident with v by atmost one. In this paper, the equitable edge chromatic number of tensor product of Path P_{m} coupled with Crown S_{n}⁰ and also two Crown graphs S_{m}⁰ along with S_{n}⁰ are obtained. | tr_TR |
| dc.language.iso | en | tr_TR |
| dc.publisher | Ankara Üniversitesi Fen Fakültesi | tr_TR |
| dc.relation.isversionof | 10.31801/cfsuasmas.524481 | tr_TR |
| dc.subject | Equitable edge coloring | tr_TR |
| dc.subject | Tensor product | tr_TR |
| dc.subject | Crown graph | tr_TR |
| dc.title | Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰ | tr_TR |
| dc.type | Article | tr_TR |
| dc.relation.journal | Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics | tr_TR |
| dc.contributor.department | Other | tr_TR |
| dc.identifier.volume | 68 | tr_TR |
| dc.identifier.issue | 2 | tr_TR |
| dc.identifier.startpage | 1294 | tr_TR |
| dc.identifier.endpage | 1300 | tr_TR |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | tr_TR |
| dc.identifier.issn/e-issn | 2618-6470 | |
| dc.contributor.faculty | Other | tr_TR |
| dc.description.index | Trdizin | tr_TR |
