On Coloring of graph fractional powers

Details On Coloring of graph fractional powers On Coloring of graph fractional powers

2008-12-08

arxiv.org/abs/0812.1542v3

Mathematics

Combinatorics

10 pages

Scientific paper

\noindent Let $G$ be a simple graph. For any $k\in N$, the $k-$power of $G$ is a simple graph $G^k$ with vertex set $V(G)$ and edge set $\{xy:d_G(x,y)\leq k\}$ and the $k-$subdivision of $G$ is a simple graph $G^{\frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. So we can introduce the $m-$power of the $n-$subdivision of $G$, as a fractional power of $G$, that is denoted by $G^{\frac{m}{n}}$. In other words $G^{\frac{m}{n}}:=(G^{\frac{1}{n}})^m$. \noindent In this paper some results about the coloring of $G^{\frac{m}{n}}$ are presented when $G$ is a simple and connected graph and $\frac{m}{n}<1$.

Affiliated with

Also associated with

No associations

Rating

On Coloring of graph fractional powers 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 On Coloring of graph fractional powers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Coloring of graph fractional powers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319477