On optimal vertex colorings of graphs

Basit Öğe Kaydı
dc.contributor.authorParsa, Esmaeil
dc.date.accessioned2024-07-12T20:49:46Z
dc.date.available2024-07-12T20:49:46Z
dc.date.issued2009en_US
dc.departmentFakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractLet c be a k-coloring of a graph G, then the number of different colors which appear in N(v) is called the coloring degree of v with respect to c and denoted by Cdc(v). K-coloring index of G is denoted by Cik(G) and defined as Cik(G) = M in{ P v?V (G) Cdc(v)} which, the minimum is over all k-colorings of G. A coloring c is called an optimal coloring of G if P v?V (G) cdc(v) 6 Cik(G), ?k. In this paper we provide some essential conditions for coloring c to be an optimal coloring and provide an algorithm to create an optimal coloring of a graph G as a conjecture along with some open problems.en_US
dc.identifier.citationParsa, E. (2009). On optimal vertex colorings of graphs. Maltepe Üniversitesi. s. 155.en_US
dc.identifier.endpage156en_US
dc.identifier.isbn9.78605E+12
dc.identifier.startpage155en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2229
dc.institutionauthorParsa, Esmaeil
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciencesen_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY07556
dc.titleOn optimal vertex colorings of graphsen_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar

Koleksiyon

İnsan ve Toplum Bilimleri Fakültesi Koleksiyonu