Results 191 to 200 of about 1,144,592 (210)

EDGE ODD GRACEFUL LABELING OF SOME FLOWER PETAL GRAPHS

Advances in Mathematics: Scientific Journal, 2020
A labeling of a graph $G$ with $\alpha$ vertices and $\beta$ edges called an edge odd graceful labeling if there is an edge labeling with odd numbers to all edges such that each vertex is assigned a label which is the sum $\mod (2\gamma)$ of labels of edge incident on it, where $\gamma=max\{\alpha,\beta\}$ and the induced vertex labels are distinct. In
B. Ambika, G. Balasubramanian
openaire   +1 more source

On k-graceful labeling of pendant edge extension of complete bipartite graphs

2023
For any two positive integers m, n, we denote the graph Km,n ??? K??? by G. Ma Ke-Jie proposed a conjecture [9] that pendant edge extension of a complete bipartite graph is a k-graceful graph for k > 2. In this paper we prove his conjecture for n ??? m < n?? + ???k/n??? + r.
Bhoumik, S., Mitra, S.
openaire   +2 more sources

Maximum Degree Based Vertex Graceful Labeling Graph with Even Labeling on Edges

2019
We characterized and illustrated the concept of maximum degree based vertex graceful labeling graph with even labeling on edges in this paper. It is a particular type of labeling vertex of a graph G with p vertices and q edges if there exists a bijection f from the edge set to the set \( \left\{ {2, 4, 6, \ldots ,2q} \right\} \) so that the induced ...
V. Rajeswari, K. Thiagarajan
openaire   +1 more source

Edge-odd graceful labeling of Cartesian product of two paths

Journal of Information and Optimization Sciences
Let G be a finite simple graph with p vertices and q edges is called an edge odd graceful labeling if there exists a bijective map f : E(G)→{1, 3, 5,,(2k − 1)} such that when each vertex is assigned, the sum of all edges incident to it mod 2k, where k = max(p, q), the resulting vertex labels are distinct.
D. Senthil Kumar, R. Anbarasan
openaire   +1 more source

Super Edge Graceful and Even Edge Graceful Labeling of Cayley Digraphs

International Journal of Mathematics Trends and Technology, 2017
R.Thami zharasi, R.Ra jeswari
openaire   +1 more source

Edge even graceful labeling of and

Materials Today: Proceedings, 2023
Pradeep G. Bhat
exaly  

EDGE – Even Graceful Labeling on Circulant Graphs

International Journal of Mathematics Trends and Technology, 2017
K.Ameenal Bibi, T.Ran jani
openaire   +1 more source

Directed edge-graceful labeling of digraph consisting of c cycles of the same size

Journal of Discrete Mathematical Sciences and Cryptography, 2022
Ratinan Boonklurb
exaly  

Graceful labeling on twig diamond graph with pendant edges*

Bulletin of Pure & Applied Sciences- Mathematics and Statistics, 2020
J. Jeba Jesintha, K. Subashini, Allu Merin Sabu   +2 more
openaire   +1 more source

Edge-odd graceful labelings of prism-like graphs of cycles

A simple graph G with q edges is called an edge-odd graceful graph, if there is a bijection f from the edge set of the graph to {1,3,5,…,2q-1} such that, when each vertex is assigned the sum of all values of the edges incident to it modulo 2q, the resulting vertex labels are distinct.
openaire   +1 more source