Show simple item record

dc.contributor.authorOkamoto, Futaba
dc.contributor.authorRasmussen, Craig W.
dc.contributor.authorZhang, Ping
dc.date2009
dc.date.accessioned2018-02-13T21:31:47Z
dc.date.available2018-02-13T21:31:47Z
dc.date.issued2009
dc.identifier.citationRasmussen, C.W. & Okamoto, F. 2009, "Set vertex colorings and joins of graphs", Czechoslovak Mathematical Journal, vol. 59, no. 4, pp. 929-941.en_US
dc.identifier.urihttp://hdl.handle.net/10945/56993
dc.descriptionThe article of record may be found at http://dml.cz/dmlcz/140526
dc.description.abstractFor a nontrivial connected graph G, let c : V (G) → ℕ be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) ≠ NC(v) for every pair u, v of adjacent vertices of G. The minimum number of colors required of such a coloring is called the set chromatic number χs(G). A study is made of the set chromatic number of the join G+H of two graphs G and H. Sharp lower and upper bounds are established for χs(G + H) in terms of χs(G), χs(H), and the clique numbers ω(G) and ω(H).
dc.format.extent14 p.
dc.language.isoen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleSet vertex colorings and joins of graphsen_US
dc.typeArticleen_US
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentApplied Mathematicsen_US
dc.subject.authorset coloring
dc.subject.authorneighbor-distinguishing coloring
dc.subject.authorneighborhood color set


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record