Some Results on incidence coloring, star arboricity and domination number

Details Some Results on incidence coloring, star arboricity and domination number Some Results on incidence coloring, star arboricity and domination number

2012-03-28

arxiv.org/abs/1203.6143v1

Mathematics

Combinatorics

8 pages

Scientific paper

Two inequalities bridging the three isolated graph invariants, incidence chromatic number, star arboricity and domination number, were established. Consequently, we deduced an upper bound and a lower bound of the incidence chromatic number for all graphs. Using these bounds, we further reduced the upper bound of the incidence chromatic number of planar graphs and showed that cubic graphs with orders not divisible by four are not 4-incidence colorable. The incidence chromatic numbers of Cartesian product, join and union of graphs were also determined.

Affiliated with

Also associated with

No associations

Rating

Some Results on incidence coloring, star arboricity and domination number 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 Some Results on incidence coloring, star arboricity and domination number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Results on incidence coloring, star arboricity and domination number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271767