2008/04/23 by Sylwia Cichacz, Dalibor Fronček, Cichacz, Sylwia +4 · 1 citation
Computer Science · Engineering · Materials Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Photochromic and Fluorescence Chemistry #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.0804.3640
7 pages, 11 figures
arxiv created 2008/04/23 · openalex publication_date 2008/04/23 · arxiv updated 2012/04/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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,± 1,± 2,...,± (q-1)/(2)\ when q is odd and from E to \± 1,± 2,...,± (q)/(2)\ when q is even such that the induced vertex labeling f^* defined by f^*(x) = ∑xy∈ E(G)f(xy) over all edges xy is a bijection from V to \0,± 1,± 2...,± (p-1)/(2)\ when p is odd and from V to \± 1,± 2,...,± (p)/(2)\ when p is even. \indent We prove that all paths Pn except P2 and P4 are super edge-graceful.