Results 241 to 250 of about 29,676 (268)
Some of the next articles are maybe not open access.

EDGE ODD GRACEFUL LABELING OF SOME FLOWER PETAL GRAPHS

Advances in Mathematics: Scientific Journal, 2020
A labeling of a graph G with α vertices and β 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γ) of labels of edge incident on it ...
B. Ambika, G. Balasubramanian
semanticscholar   +2 more sources

Edge Trimagic Graceful Labeling of Tadpole Graph

International Journal of Science, Architecture, Technology and Environment
J. A. J. Ezhil
semanticscholar   +2 more sources

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

Journal of Discrete Mathematical Sciences and Cryptography, 2021
A graph G = (V, E) is said to be directed edge-graceful if there exists an orientation of G and a directed edge-graceful labeling f of the arcs of G with {1, 2, 3, … ,|E|} such that the induced mapping g on V defined by g(v) = (f +(v) - f −(v)) (mod |V|)
Ratinan Boonklurb   +2 more
semanticscholar   +1 more source

Edge Odd Graceful Labeling of Some Ladder and Path Related Graphs

Indian Journal of Industrial and Applied Mathematics
An 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
K. V. Darshana, K. K. Kailas
semanticscholar   +1 more source

Super–edge–graceful Labelings of Some Cubic Graphs

Acta Mathematica Sinica, English Series, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

PRIME GRACEFUL LABELING IN DIRECTED GRAPHS AND APPLICATIONS: A CRYPTOGRAPHIC APPROACHAQ

Global and Stochastic Analysis
. This paper introduces prime graceful digraphs, a novel class of directed graphs with a labeling approach that integrates injectivity and prime-related constraints.
A. And, Kumudakshi
semanticscholar   +1 more source

Arithmetic Sequential Graceful Labeling For Arrow Graphs

IOSR Journal of Mathematics
Let G be a simple, finite, connected, undirected, non-trivial graph with 𝑝 vertices and 𝑞 edges. 𝑉(𝐺) be the vertex set and 𝐸(𝐺) be the edge set of 𝐺. Let 𝑓: 𝑉(𝐺) → {𝑎, 𝑎 + 𝑑, 𝑎 + 2𝑑, 𝑎 + 3𝑑, … , 𝑎 + 2𝑞𝑑} where a ≥ 0 and 𝑑 ≥ 1 is an injective function ...
P. Sumathi, G. G. Ramani
semanticscholar   +1 more source

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 even graceful labeling of Frn3,Fn,TPn,Wn and Tn

Materials Today: Proceedings, 2023
Pradeep G Bhat
exaly  

Home - About - Disclaimer - Privacy