A note on fold thickness of graphs
Abstract A 1-fold of G is the graph G0 obtained from a graph G by identifying two nonadjacent vertices in G having at least one common neighbor and reducing the resulting multiple edges to simple edges. A uniform k-folding of a graph G is a sequence of graphs G = G0, G1, G2,...,Gk, where Gi+1 is a 1-fold of Gi for i = 0, 1, 2,...,k − 1 such that all graphs in the sequence are singular or all of them are nonsingular. The largest k for which there exists a uniform k- folding of G is called fold thickness of G and this concept was first introduced in [1]. In this paper, we determine fold thickness of corona product graph G ʘ , G ʘ S , and graph join G + .
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2023
|
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172023000100167 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|