Results 21 to 30 of about 29,676 (268)
Study on Binary Equivalent Decimal Edge Graceful Labeling
Let G (V(G), E(G)) be a graph with n vertices is said to be Binary Equivalent Decimal Edge Graceful Labeling (BEDE) graph if the vertices are assigned distinct numbers from 0,1,2,…,(n-1) such that the labels induced on edges by the values obtained using ...
V. Rajeswari, K. Thiagarajan
semanticscholar +2 more sources
Edge-Graceful Labelings of Connected Graphs
Abstract Let G be a connected edge-graceful ( p , q ) -graph with q = k p + r , where k is an integer and 0 ≤ r p . In this paper, we prove that every edge-graceful labeling f of G induces [ ( k + 1 ) ! ] r [ k ! ] p − r number of edge-graceful labelings of G.
R Amutha
exaly +2 more sources
Further results on edge even graceful labeling of the join of two graphs [PDF]
In this paper, we investigated the edge even graceful labeling property of the join of two graphs. A function f is called an edge even graceful labeling of a graph G =( V ( G ), E ( G )) with p =| V ( G )| vertices and q =| E ( G )| edges if f : E ( G )→{
Mohamed R. Zeen El Deen, Nora A. Omar
semanticscholar +4 more sources
Super Edge Magic Graceful Labeling of Generalized Petersen Graphs
Abstract A ( p , q ) graph G is edge magic graceful if there exists a bijection f : V ( G ) ∪ E ( G ) → { 1 , 2 , … , p + q } such that | f ( u ) + f ( v ) − f ( u v ) | = k , a constant for any edge uv of G. G is said to be super edge magic graceful if f ( V ( G ) ) = { 1 , 2
G Marimuthu
exaly +2 more sources
Planar and non-planar wheel-related networks possess edge -graceful labeling
For an integer [Formula: see text], consider a collection of numbers [Formula: see text] and a network [Formula: see text] with [Formula: see text] and [Formula: see text].
Mohamed R. Zeen El Deen +3 more
doaj +2 more sources
Directed edge - graceful labeling of Cycle and star related graphs
Rosa [13] introduced the notion of graceful labelings. The concept of magic, antimagic and conservative labelings have been extended to directed graphs [11]. Bloom and Hsu [3, 4, 5] extended the notion of graceful labeling to directed graphs. In 1985, Lo [12] introduced the notion of edge – graceful graphs. We introduced [8] the concept of edge
V. Vanitha, B. Gayathri
semanticscholar +2 more sources
Graceful labelings of the generalized Petersen graphs [PDF]
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is an injection $f: V(G) \rightarrow \{0,1,\ldots,m\}$ such that the resulting edge labels obtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct.
Zehui , Fei , Zepeng
doaj +1 more source
Polygonal Graceful Labeling of Some Simple Graphs
Let be a graph with vertices and edges. Let andbe the vertex set and edge set of respectively. A polygonal graceful labeling of a graph is an injective function , where is a set of all non-negative integers that induces a bijection , where is the ...
A Rama Lakshmi, M P Syed Ali Nisaya
doaj +1 more source
New classes of graphs with edge $ \; \delta- $ graceful labeling
<abstract><p>Graph labeling is a source of valuable mathematical models for an extensive range of applications in technologies (communication networks, cryptography, astronomy, data security, various coding theory problems). An edge $ \; \delta - $ graceful labeling of a graph $ G $ with $ p\; $ vertices and $ q\; $ edges, for any ...
Mohamed R. Zeen El Deen +1 more
openaire +2 more sources
Matching-Type Image-Labelings of Trees
A variety of labelings on trees have emerged in order to attack the Graceful Tree Conjecture, but lack showing the connections between two labelings. In this paper, we propose two new labelings: vertex image-labeling and edge image-labeling, and combine ...
Jing Su, Hongyu Wang, Bing Yao
doaj +1 more source

