Results 81 to 90 of about 209,693 (137)

Ordered graceful labellings of the 2-star

Discrete Mathematics, 2001
The authors investigate ordered graceful labellings of 2-stars. They give a lower bound on the number of non-equivalent ordered graceful labellings by constructing an exponential number of such labellings. This shows that a conjecture of Cahit is false.
Richard J. Nowakowski, Carol A. Whitehead   +1 more
openaire   +3 more sources

Absolute Mean Graceful Labeling in Path Union of Various Graphs [PDF]

, 2018
Present paper aims to focus on absolute mean graceful labeling in path union of various graphs. We proved path union of graphs like tree, path Pn, cycle Cn, complete bipartite graph Km, n, grid graph PM × Pn, step grid graph Stn and double step grid ...
H P Chudasama, V J Kaneria, P P Andharia
core   +1 more source

Alpha labelings of full hexagonal caterpillars

AKCE International Journal of Graphs and Combinatorics, 2016
Barrientos and Minion (2015) introduced the notion of generalized snake polyomino graphs and proved that when the cells are either squares or hexagons, then they admit an alpha labeling. Froncek et al.
Dalibor Froncek
doaj   +1 more source

The Graceful Coalescence of Alpha Cycles

Communications in Advanced Mathematical Sciences, 2019
The standard coalescence of two graphs is extended, allowing to identify two isomorphic subgraphs instead of a single vertex. It is proven here that any succesive coalescence of cycles of size $n$, where $n$ is divisible by four, results in an $\alpha ...
Christian Barrientos, Sarah Minion
doaj   +1 more source

D-Graceful Labeling of a Path

, 2016
[[abstract]]Let G be a undirected graph with a vertex set V and an edge set E. Given a nonnegative integer set D. A D-graceful labeling f of G is an injection f : V → D such that {|f(x) − f(y)| ¯¯ xy ∈ E} = {1, 2, 3, . . . , |E|}.
顏經和, Chi-Nan Chang, 張吉南, Jing-Ho Yan   +3 more
core  

Graceful labeling of graphs in school problems

, 2020
summary:Téma graciózneho ohodnotenia grafov je dnes v školách úplne neznáma, čo je veľká škoda, pretože ide nepochybne o oblasť teórie grafov, ktorá ma veľký potenciál pomôcť žiakom rozvíjať matematické myslenie.
Lekár, Milan
core   +1 more source

Folding trees gracefully

AKCE International Journal of Graphs and Combinatorics, 2020
When a graceful labeling of a bipartite graph assigns the smaller labels to the vertices of one of the stable sets of the graph, the assignment is called an α-labeling. Any graph that admits such a labeling is an α-graph.
Christian Barrientos, Sarah Minion
doaj   +1 more source

Graceful labeling of zero-divisor graph Γ(ℤp²q) and Γ(ℤp³q)

Electronic Journal of Graph Theory and Applications
Some papers have already provided graceful labeling for some types of zero-divisor graphs. We reviewed the graceful labeling results of Γ(ℤ25), Γ(ℤ8), and Γ(ℤ27), then use those results to label zero-divisors graphs Γ(ℤ25q), Γ(ℤ8q), and Γ(ℤ27q).The ...
Christian Constantine, Erma Suwastika
doaj   +1 more source

Edge Odd Graceful Labeling of Cylinder and Torus Grid Graphs

IEEE Access, 2019
Solairaju and Chithra introduced a new type of labeling of a graph G with p vertices and q edges called an edge odd graceful labeling if there is a bijection f from the edges of the graph to the set {1, 3, ...
S. N. Daoud
doaj   +1 more source

Graceful Labeling of Balanced Stars of Paths

Electronic Notes in Discrete Mathematics, 2003
Abstract If the vertices of a tree on n vertices are labeled by the distinct numbers l,2,…, n , in such a way that the set of edge-differences (i.e., the differences between the labels on adjacent pairs of vertices) is exactly {1, 2,…, n − 1}, then such a labeling is called a graceful labeling. The graceful tree conjecture of Ringel and Kotzig
R. Badrinath, Pratima Panigrahi
openaire   +1 more source