Restricted triangulation on circulant graphs
Niran Abbas Ali, Adem Kılıçman, Hazim Michman Trao · Open Mathematics · 2018
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. LetG=C(n,S) be a circulant graph onnvertices with jump value setS. We consider the restricted triangulation existence problem forG. We determine necessary and sufficient conditions onSfor whichGadmitting a restricted triangulation. We characterize a set of jump valuesS(n) that has the smallest cardinality withC(n,S(n)) admits a restricted triangulation. We present the measure of non-triangulability ofKn−Gfor a givenG.