Equitable edge coloring on tensor product of graphs
| dc.contributor.author | VENİNSTİNE, Vivik J | |
| dc.contributor.author | AKBAR ALI, M. M. | |
| dc.contributor.author | GIRIJA, G. | |
| dc.contributor.department | Other | tr_TR |
| dc.contributor.faculty | Other | tr_TR |
| dc.date.accessioned | 2021-11-29T12:53:16Z | |
| dc.date.available | 2021-11-29T12:53:16Z | |
| dc.date.issued | 2020-12-31 | |
| dc.description.abstract | A graph G is edge colored if different colors are assigned to its edges or lines, in the order of neighboring edges are allotted with least diverse k-colors. If each of k-colors can be partitioned into color sets and differs by utmost one, then it is equitable. The minimum of k-colors required is known as equitably edge chromatic number and symbolized by χ ′ = ( G ) . Further the impression of equitable edge coloring was first initiated by Hilton and de Werra in 1994. In this paper, we ascertain the equitable edge chromatic number of P m ⊗ P n , P m ⊗ C n and K 1 , m ⊗ K 1 , n . | tr_TR |
| dc.description.index | Trdizin | tr_TR |
| dc.identifier.endpage | 1344 | tr_TR |
| dc.identifier.issn/e-issn | 2618-6470 | |
| dc.identifier.issue | 2 | tr_TR |
| dc.identifier.startpage | 1336 | tr_TR |
| dc.identifier.uri | https://doi.org/10.31801/cfsuasmas.716392 | tr_TR |
| dc.identifier.uri | http://hdl.handle.net/20.500.12575/76426 | |
| 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.716392 | 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 edge coloring | tr_TR |
| dc.subject | Tensor product | tr_TR |
| dc.title | Equitable edge coloring on tensor product of graphs | tr_TR |
| dc.type | Article | tr_TR |