Super edge-graceful paths

TL;DR

This paper introduces the concept of super edge-graceful graphs, focusing on paths, and proves that all paths except for P2 and P4 possess this property, expanding understanding of graph labelings.

Contribution

The paper defines super edge-graceful graphs and establishes that all paths except P2 and P4 are super edge-graceful, providing new classifications in graph labeling theory.

Findings

All paths P_n except P_2 and P_4 are super edge-graceful.

Provides a characterization of super edge-graceful paths.

Expands the class of graphs known to have super edge-graceful labelings.

Abstract

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.