Results 31 to 40 of about 29,676 (268)
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
Graceful labeling construction for some special tree graph using adjacency matrix
Electronic Journal of Graph Theory and Applications, 2023 In 1967, Rosa introduced β − labeling which was then popularized by Golomb under the name graceful. Graceful labeling on a graph G is an injective function f : V(G)→{0, 1, 2, …, |E(G)|} such that, when each edge uv ∈ E(G) is assigned the label |f(u)−f(v)|
Nikson Simarmata +2 more
doaj +1 more source
A survey and a new class of graceful unicylic graphs
AKCE 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
Indonesian 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
SOME CARTESIAN PRODUCTS OF A PATH AND PRISM RELATED GRAPHS THAT ARE EDGE ODD GRACEFUL [PDF]
, 2021 Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its order and its size. Let $f$ be a bijective edge labeling which codomain is the set of odd integers from 1 up to $2q-1$.
Susanti, Yeni +3 more
core +2 more sources
On Cubic Graceful Labeling [PDF]
, 2017 A graph with n vertex and m edges is said to be cubic graceful labeling if its vertices are labeled with distinct integers {0,1,2,3,……..,m3} such that for each edge f*( uv) induces edge mappings are {13,23,33,……,m3}.
, Mathew Varkey T. K, Mini. S. Thomas
core +2 more sources
Alpha Labeling of Amalgamated Cycles
Theory and Applications of Graphs, 2022 A graceful labeling of a bipartite graph is an \a-labeling if it has the property that the labels assigned to the vertices of one stable set of the graph are smaller than the labels assigned to the vertices of the other stable set.
Christian Barrientos
doaj +1 more source
Edge even graceful labelling of new families of graphs [PDF]
Journal of Taibah University for Science, 2019 Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such that, when each vertex is assigned the sum of all edges incident to it mod $2k $, where $k = \max (p,q ) $,
S. N. Daoud, Ahmed N. Elsawy
openaire +2 more sources
Journal of Mathematics, 2023 In this article, we adapt the edge-graceful graph labeling definition into block designs and define a block design V,B with V=v and B=b as block-graceful if there exists a bijection f:B⟶1,2,…,b such that the induced mapping f+:V⟶Zv given by f+x=∑x∈AA ...
Dilara Erdemir, Emre Kolotoğlu
doaj +1 more source
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +1 more source