The Graceful Coalescence of Alpha Cycles
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$-graph, that is, the most restrictive kind of gr...
Main Authors: | Christian Barrientos, Sarah Minion |
---|---|
Format: | Article |
Language: | English |
Published: |
Emrah Evren KARA
2019-06-01
|
Series: | Communications in Advanced Mathematical Sciences |
Subjects: | |
Online Access: | https://dergipark.org.tr/tr/download/article-file/745297 |
Similar Items
-
Alpha Labeling of Amalgamated Cycles
by: Christian Barrientos
Published: (2022-10-01) -
Special Graceful Labelings of Irregular Fences and Lobsters
by: Christian Barrientos
Published: (2019-03-01) -
Octagonal prime graceful labeling
by: V Akshaya
Published: (2024-01-01) -
Edge Even Graceful Labeling of Cylinder Grid Graph
by: Ahmed A. Elsonbaty, et al.
Published: (2019-04-01) -
Radio Graceful Hamming Graphs
by: Niedzialomski Amanda
Published: (2016-11-01)