Restricted triangulation on circulant graphs

Citation

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

Abstract

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 .

Download File

Text (Abstract)
Restricted triangulation on circulant graphs.pdf
Download (56kB)

Additional Metadata

Item Type:	Article
Divisions:	Faculty of Science
DOI Number:	https://doi.org/10.1515/math-2018-0033
Publisher:	De Gruyter
Keywords:	Triangulation; Circulant graph
Depositing User:	Ms. Nida Hidayati Ghazali
Date Deposited:	08 May 2020 18:05
Last Modified:	08 May 2020 18:05
Altmetrics:	https://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1515/math-2018-0033
URI:	http://psasir.upm.edu.my/id/eprint/73782
Statistic Details:	View Download Statistic

Actions (login required)

View Item