Results 11 to 20 of about 4,425 (218)

A note on edge – Graceful labeling for Corona and flower graph [PDF]

open access: bronzeAIP Conference Proceedings, 2019
Research in graph theory has lead to one of the important area called labeling of graphs. There are different types of labeling such as graceful labeling, magic labeling, edge-graceful labeling, prime labeling, radio labeling, harmonious labeling etc., In this paper, we investigate the existence of edge graceful labeling for the Corona graph Cn⊙K2¯ (n ...
J. Uma, A. Mazudha Shanofer
openaire   +2 more sources

The Edge Odd Graceful Labeling of Water Wheel Graphs [PDF]

open access: goldAxioms
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   +2 more sources

Edge odd graceful labeling of some path and cycle related graphs

open access: goldAKCE 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   +2 more sources

Paley, Cubic Paley, Quadruple Paley, and Generalized Paley Graphs with an Edge-Graceful Labeling

open access: diamondEuropean Journal of Pure and Applied Mathematics
The Paley graph Pq is a simple connected strongly regular graph with (q, q−1/2 , q−5/4 , q−1/4 ) as its parameters, where V (Pq) is the finite field Fq of order q = pn, p is an odd prime, n ∈ N, and q ≡ 1 (mod 4). In Paley graphs, two vertices are adjacent if their difference is a quadratic residue (mod q).
Ahmed Noubi Sayed Elsawy   +1 more
openaire   +3 more sources

Graceful Labeling and Skolem Graceful Labeling on the U-star Graph and It’s Application in Cryptography

open access: yesJambura Journal of Mathematics, 2021
Graceful Labeling on graph G=(V, E) is an injective function f from the set of the vertex V(G) to the set of numbers {0,1,2,...,|E(G)|} which induces bijective function f from the set of edges E(G) to the set of numbers {1,2,...,|E(G)|} such that for ...
Meliana Pasaribu   +2 more
doaj   +1 more source

Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs

open access: yesRatio Mathematica, 2022
Let r be any natural number. An injective function , where  is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that  is bijective.
K Sunitha, M Sheriba
doaj   +1 more source

Matching-Type Image-Labelings of Trees

open access: yesMathematics, 2021
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

m-Bonacci graceful labeling

open access: yesAKCE International Journal of Graphs and Combinatorics, 2021
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam   +1 more
doaj   +1 more source

A survey and a new class of graceful unicylic graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
A graph G admits a graceful labeling if there is a one-to-one map f from the set of vertices of G to such that when an edge xy is assigned the label the resulting set of edge labels is When such a labeling exists, G is called graceful. Rosa showed that a
Max Pambe Biatch’   +2 more
doaj   +1 more source

On graphs with α- and b-edge consecutive edge magic labelings

open access: yesIndonesian Journal of Combinatorics, 2022
Among the most studied graph labelings we have the varieties called alpha and edge-magic. Even when their definitions seem completely different, these labelings are related.
Christian Barrientos
doaj   +1 more source

Home - About - Disclaimer - Privacy