Super edge-graceful paths

Details Super edge-graceful paths Super edge-graceful paths

2008-04-23

arxiv.org/abs/0804.3640v1

Mathematics

Combinatorics

7 pages, 11 figures

Scientific paper

A graph $G(V,E)$ of order $|V|=p$ and size $|E|=q$ is called super edge-graceful if there is a bijection $f$ from $E$ to $\{0,\pm 1,\pm 2,...,\pm \frac{q-1}{2}\}$ when $q$ is odd and from $E$ to $\{\pm 1,\pm 2,...,\pm \frac{q}{2}\}$ when $q$ is even such that the induced vertex labeling $f^*$ defined by $f^*(x) = \sum_{xy\in E(G)}f(xy)$ over all edges $xy$ is a bijection from $V$ to $\{0,\pm 1,\pm 2...,\pm \frac{p-1}{2}\}$ when $p$ is odd and from $V$ to $\{\pm 1,\pm 2,...,\pm \frac{p}{2}\}$ when $p$ is even. \indent We prove that all paths $P_n$ except $P_2$ and $P_4$ are super edge-graceful.

Affiliated with

Also associated with

No associations

Rating

Super edge-graceful paths 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 Super edge-graceful paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Super edge-graceful paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-104569