Restricted triangulation on circulant graphs
The restricted triangulation existence problem on a given graph decides whether there exists a triangulation on the graph’s vertex set that is restricted with respect to its edge set. Let G = C ( n , S ) be a circulant graph on n vertices with jump value set S . We consider the restricted triangulat...
| Autors principals: | , , |
|---|---|
| Format: | Article |
| Idioma: | English |
| Publicat: |
De Gruyter
2018
|
| Accés en línia: | http://psasir.upm.edu.my/id/eprint/73782/1/Restricted%20triangulation%20on%20circulant%20graphs.pdf |
| Sumari: | The restricted triangulation existence problem on a given graph decides whether there exists a triangulation on the graph’s vertex set that is restricted with respect to its edge set. Let G = C ( n , S ) be a circulant graph on n vertices with jump value set S . We consider the restricted triangulation existence problem for G . We determine necessary and sufficient conditions on S for which G admitting a restricted triangulation. We characterize a set of jump values S ( n ) that has the smallest cardinality with C ( n , S ( n )) admits a restricted triangulation. We present the measure of non-triangulability of K n − G for a given G . |
|---|