Weighted-Set Graph Colorings

Details Weighted-Set Graph Colorings Weighted-Set Graph Colorings

2009-11-22

arxiv.org/abs/0911.4218v1

J. Stat. Phys. 139, 27-61 (2010)

Physics

Mathematical Physics

44 p. latex

Scientific paper

10.1007/s10955-010-9937-4

We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$ colors contained in the set of $q$ colors. We construct and analyze a weighted-set chromatic polynomial $Ph(G,q,s,w)$ associated with this coloring. General properties of this weighted-set chromatic polynomial are proved, and illustrative calculations are presented for various families of graphs. This study extends a previous one for the case $s=1$ and reveals a number of interesting new features.

Affiliated with

Also associated with

No associations

Rating

Weighted-Set Graph Colorings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Weighted-Set Graph Colorings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted-Set Graph Colorings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-417924