dc.contributor.author | Alikhani, Saeid | |
dc.contributor.author | Ghanbari, Nima | |
dc.date.accessioned | 2022-08-10T07:11:19Z | |
dc.date.available | 2022-08-10T07:11:19Z | |
dc.date.created | 2022-08-08T12:16:18Z | |
dc.date.issued | 2022 | |
dc.identifier.issn | 2587-1013 | |
dc.identifier.uri | https://hdl.handle.net/11250/3010962 | |
dc.description.abstract | We introduce the total dominator edge chromatic number of a graph G. A total dominator edge coloring (briefly TDE-coloring) of G is a proper edge coloring of G in which each edge of the graph is adjacent to every edge of some color class. The total dominator edge chromatic number (briefly TDEC-number) χt d(G) of G is the minimum number of color classes in a TDE-coloring of G. We obtain some properties of χt d(G) and compute this parameter for specific graphs. We examine the effects on χt d(G) when G is modified by operations on vertices and edges of G. Finally, we consider the k-subdivison of G and study TDEC-number of this kind of graphs. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Isik University | en_US |
dc.rights | Navngivelse-Ikkekommersiell 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc/4.0/deed.no | * |
dc.title | Introduction to total dominator edge chromatic number | en_US |
dc.type | Journal article | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright Isik University, Department of Mathematics, 2022 | en_US |
cristin.ispublished | true | |
cristin.fulltext | original | |
dc.identifier.cristin | 2041694 | |
dc.source.journal | TWMS Journal of Applied and Engineering Mathematics | en_US |
dc.source.pagenumber | 786-798 | en_US |
dc.identifier.citation | TWMS Journal of Applied and Engineering Mathematics. 2022, 12 (3), 786-798. | en_US |
dc.source.volume | 12 | en_US |
dc.source.issue | 3 | en_US |