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: | , |
---|---|
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 |