On the fold thickness of graphs
Abstract The graph $$G'$$ G ′ obtained from a graph G by identifying two nonadjacent vertices in G having at least one common neighbor is called a 1-fold of G. A sequence $$G_0, G_1, G_2, \ldots , G_k$$ G 0 , G 1 , G 2 , … , G k of graphs such that $$G_0=G$$ G 0 = G and $$G_i$$ G i is a 1-fold...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2020-02-01
|
| Series: | Arabian Journal of Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s40065-020-00276-z |