Results 71 to 80 of about 209,693 (137)
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
Fibonacci and Super Fibonacci Graceful Labeling of Some Graphs [PDF]
, 2011 In the present work we discuss the existence and non-existence of Fibonacci and super Fibonacci graceful labeling for certain graphs. We also show that the graph obtained by switching a vertex in cycle Cn, (where 6n ) is not super Fibonacci graceful but
S. K. Vaidya, et al., Vaidya, S. K.
core +1 more source
BEBERAPA ALGORITMA PELABELAN GRACEFUL UNTUK GRAF CATERPILLAR [PDF]
, 2023 Graceful labeling, first introduced by Rosa as β-labeling. A graceful labeling (or β-labeling) on a graph G involves assigning labels to its set of vertices, forming an injective function f that maps each vertex to the set of non-negative integers {0 ...
Runtu, Patricia V. J +2 more
core +1 more source
SUPER EDGE MAGIC GRACEFUL TOTAL LABELING OF SOME GRAPHS [PDF]
, 2019 Let a ( , ) p q graph G with the vertex set V G( ) , the edge set E G( ) , the number of vertices is p, and the number of edges is q. The edge magic graceful total labeling of graph G is a bijection from V G E G ( ) ( ) to the integers {1, 2,.
Wahyudi, Zainatul Fatimah Mutiara
core +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
On the Graceful Cartesian Product of Alpha-Trees
Theory and Applications of Graphs, 2017 A \emph{graceful labeling} of a graph $G$ of size $n$ is an injective assignment of integers from the set $\{0,1,\dots,n\}$ to the vertices of $G$ such that when each edge has assigned a \emph{weight}, given by the absolute value of the difference of the
Christian Barrientos, Sarah Minion
doaj +1 more source
A note on the number of graceful labellings of paths
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert E. L. Aldred +2 more
openaire +2 more sources
Edge-Graceful Labelings of Connected Graphs
Electronic Notes in Discrete Mathematics, 2016 Abstract Let G be a connected edge-graceful ( p , q ) -graph with q = k p + r , where k is an integer and 0 ≤ r p . In this paper, we prove that every edge-graceful labeling f of G induces [ ( k + 1 ) ! ] r [ k ! ] p − r number of edge-graceful labelings of G.
K. Kayathri, R. Amutha
openaire +2 more sources
Graceful labelling of the union of paths and cycles
Discrete Mathematics, 1999 The authors show that \(C_5\cup P_n\) is graceful and \(C_s\cup P_n\) is graceful for every \(s\geq 5\) when \(n\geq (s+ 5)/2\). This result is another step towards settling the conjecture that \(C_s\cup P_n\) is graceful whenever \(n+ s\geq 7\).
Sheshayya A. Choudum +1 more
openaire +2 more sources
Alpha graphs with different pendent paths
Electronic Journal of Graph Theory and Applications, 2020 Graceful labelings are an effective tool to find cyclic decompositions of complete graphs and complete bipartite graphs. The strongest kind of graceful labeling, the α-labeling, is in the center of the research field of graph labelings, the existence of ...
Christian Barrientos
doaj +1 more source