Results 31 to 40 of about 1,092,292 (254)
Super Fibonacci Graceful Labeling [PDF]
, 2011 Approaching topics such as Smarandache-Fibonacci triple, graceful labeling, Fibonacci graceful labeling, super Smarandache-Fibonacci graceful graph, super Fibonacci graceful ...
Sridevi, R. +2 more
core +1 more source
Lucas Graceful Labeling for Some Graphs [PDF]
, 2011 By a graph, we mean a finite undirected graph without loops or multiple ...
Perumal, M.A. +2 more
core +1 more source
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
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 +1 more source
A note on edge – Graceful labeling for Corona and flower graph [PDF]
AIP 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 +1 more source
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
Edge even graceful labelling of some book graphs [PDF]
Journal of Taibah University for Science, 2018 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 if there is a bijection f from the edges of the graph to the set $\{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 )$, the resulting ...
S.N. Daoud, Ahmed N. Elsawy
openaire +2 more sources
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
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
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 +1 more source