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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2018
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/73782/1/Restricted%20triangulation%20on%20circulant%20graphs.pdf |
| _version_ | 1796979630969716736 |
|---|---|
| author | Ali, Niran Abbas Kilicman, Adem Trao, Hazim Michman |
| author_facet | Ali, Niran Abbas Kilicman, Adem Trao, Hazim Michman |
| author_sort | Ali, Niran Abbas |
| collection | UPM |
| description | 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 . |
| first_indexed | 2024-03-06T10:11:43Z |
| format | Article |
| id | upm.eprints-73782 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-03-06T10:11:43Z |
| publishDate | 2018 |
| publisher | De Gruyter |
| record_format | dspace |
| spelling | upm.eprints-737822020-05-08T18:05:35Z http://psasir.upm.edu.my/id/eprint/73782/ Restricted triangulation on circulant graphs Ali, Niran Abbas Kilicman, Adem Trao, Hazim Michman 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 . De Gruyter 2018 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/73782/1/Restricted%20triangulation%20on%20circulant%20graphs.pdf Ali, Niran Abbas and Kilicman, Adem and Trao, Hazim Michman (2018) Restricted triangulation on circulant graphs. Open Mathematics, 16 (1). 358 - 369. ISSN ESSN: 2391-5455 10.1515/math-2018-0033 |
| spellingShingle | Ali, Niran Abbas Kilicman, Adem Trao, Hazim Michman Restricted triangulation on circulant graphs |
| title | Restricted triangulation on circulant graphs |
| title_full | Restricted triangulation on circulant graphs |
| title_fullStr | Restricted triangulation on circulant graphs |
| title_full_unstemmed | Restricted triangulation on circulant graphs |
| title_short | Restricted triangulation on circulant graphs |
| title_sort | restricted triangulation on circulant graphs |
| url | http://psasir.upm.edu.my/id/eprint/73782/1/Restricted%20triangulation%20on%20circulant%20graphs.pdf |
| work_keys_str_mv | AT aliniranabbas restrictedtriangulationoncirculantgraphs AT kilicmanadem restrictedtriangulationoncirculantgraphs AT traohazimmichman restrictedtriangulationoncirculantgraphs |