Results 11 to 20 of about 1,212,791 (104)

Edge odd graceful labeling of some path and cycle related graphs

AKCE International Journal of Graphs and Combinatorics, 2017
Solairaju and Chithra introduced a new type of labeling of a graph with vertices and edges called an edge odd graceful labeling if there is a bijection from the edges of the graph to the set such that, when each vertex is assigned the sum of all edges ...
S.N. Daoud
doaj   +5 more sources

The Edge Odd Graceful Labeling of Water Wheel Graphs

Axioms
A graph, G=(V,E), is edge odd graceful if it possesses edge odd graceful labeling. This labeling is defined as a bijection g:E(G)→{1,3,…,2m−1}, from which an injective transformation is derived, g*:V(G)→{1,2,3,…,2m−1}, from the rule that the image of u∈V(
Mohammed Aljohani, Salama Nagy Daoud
doaj   +5 more sources

Edge Odd Graceful Labeling in Some Wheel-Related Graphs

Mathematics
A graph’s edge labeling involves the allocation of symbols (colors or numbers) to the edges of a graph governed by specific criteria. Such labeling of a graph G with order n and size m is named edge odd graceful if there is a bijective map φ from the set
Mohammed Aljohani, Salama Nagy Daoud
doaj   +5 more sources

Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs [PDF]

IEEE Access, 2019
Solairaju and Chithra introduced a new type of labeling of a graph G with p vertices and q edges called an edge odd graceful labeling if there is a bijection f from the edges of the graph to the set {1, 3, ...
S. N. Daoud
doaj   +5 more sources

On edge-graceful labeling and deficiency for regular graphs

AKCE International Journal of Graphs and Combinatorics, 2018
An edge-graceful labeling of a finite simple graph with vertices and edges is a bijection from the set of edges to the set of integers such that the vertex sums are pairwise distinct modulo , where the vertex sum at a vertex is the sum of labels of all ...
Tao-Ming Wang, Guang-Hui Zhang
doaj   +3 more sources

Tight super-edge-graceful labelings of trees and their applications [PDF]

AKCE International Journal of Graphs and Combinatorics, 2015
The concept of graceful labeling of graphs has been extensively studied. In 1994, Mitchem and Simoson introduced a stronger concept called super-edge-graceful labeling for some classes of graphs.
Alex Collins, Colton Magnant, Hua Wang
doaj   +2 more sources

Edge Odd Graceful Labeling of Some Ladder and Path Related Graphs

Indian Journal of Industrial and Applied Mathematics
AbstractAn edge odd graceful labeling of graph G with p vertices and q edges is a modular technique of edge labeling, introduced bySolairaju and Chithra in 2008 [9]. It is a bijection f from the edge set E(G) of the graph to {1, 3,…, 2q - 1} such that, when each vertex is assigned the sum of all the edges incident to it mod 2q, the resulting vertex ...
K Valani Darshana, K Kanani Kailas
openaire   +2 more sources

Edge Even Graceful Labeling of Polar Grid Graphs

Symmetry, 2019
Edge Even Graceful Labelingwas first defined byElsonbaty and Daoud in 2017. An edge even graceful labeling of a simple graph G with p vertices and q edges is a bijection f from the edges of the graph to the set { 2 , 4 ...
S N Daoud
exaly   +2 more sources

Edge Even Graceful Labeling of Cylinder Grid Graph

Symmetry, 2019
Edge even graceful labeling (e.e.g., l.) of graphs is a modular technique of edge labeling of graphs, introduced in 2017. An e.e.g., l. of simple finite undirected graph G = ( V ( G ) , E ( G ) ) of order P = | ( V ( G ) | and size
S N Daoud
exaly   +2 more sources

Edge even and edge odd graceful labelings of Paley Graphs

Journal of Physics: Conference Series, 2021
Abstract Edge even graceful labeling is a novel graceful labelling, introduced in 2017 by Elsonbaty and Daoud. A graph G with p vertices and q edges is called an edge even graceful if there is a bijection f: E(G) → {2, 4,. . ., 2q} such that, when each vertex is assigned the sum of the labels of all edges incident to it mod 2k, where k =
T Kamaraj, J Thangakani
openaire   +1 more source