On irregular colorings of double wheel graph families

Simple item page
dc.contributor.authorRohini, A.
dc.contributor.authorVenkatachalam, M.
dc.contributor.departmentOthertr_TR
dc.contributor.facultyOthertr_TR
dc.date.accessioned2021-11-03T07:25:16Z
dc.date.available2021-11-03T07:25:16Z
dc.date.issued2019-02-01
dc.description.abstractAn assignment of colors to the vertices of a graph, so that no two adjacent vertices get the same color is called a proper coloring. An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the graph either by their own colors or by the colors of their neighbours. In this paper, we investigate the irregular chromatic number for the middle graph, total graph, central graph and line graph of double wheel graph.tr_TR
dc.description.indexTrdizintr_TR
dc.identifier.endpage949tr_TR
dc.identifier.issn/e-issn2618-6470
dc.identifier.issue1tr_TR
dc.identifier.startpage944tr_TR
dc.identifier.urihttps://doi.org/10.31801/cfsuasmas.490001tr_TR
dc.identifier.urihttp://hdl.handle.net/20.500.12575/75853
dc.identifier.volume68tr_TR
dc.language.isoentr_TR
dc.publisherAnkara Üniversitesi Fen Fakültesitr_TR
dc.relation.isversionof10.31801/cfsuasmas.490001tr_TR
dc.relation.journalCommunications Faculty of Sciences University of Ankara Series A1 Mathematics and Statisticstr_TR
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıtr_TR
dc.subjectIrregular coloringtr_TR
dc.subjectMiddle graphtr_TR
dc.subjectTotal graphtr_TR
dc.titleOn irregular colorings of double wheel graph familiestr_TR
dc.typeArticletr_TR

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
79.pdf
Size:
254.12 KB
Format:
Adobe Portable Document Format
Description:
Dergi
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Cilt:68 Sayı:01 (2019)