UPM Institutional Repository

Triangulability of convex graphs and convex skewness


Citation

Ali, Niran Abbas and Chia, Gek L. and Trao, Hazim Michman and Kilicman, Adem (2021) Triangulability of convex graphs and convex skewness. Discrete Mathematics, Algorithms and Applications, 14 (4). pp. 1-7. ISSN 1793-8309; ESSN: 1793-8317

Abstract

Suppose F is a subgraph of a convex complete graph Kn and F contains no boundary edge of Kn and |E(F)|≤n−1. We determine necessary and sufficient conditions on F such that Kn−F admits a triangulation. For |E(F)|≥n, we investigate the possibility of placing F in Kn such that Kn−F admits a triangulation for certain families of graphs F. These results are then applied to determine the convex skewness of the convex graphs of the form Kn−F.


Download File

Full text not available from this repository.

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
DOI Number: https://doi.org/10.1142/S1793830921501469
Publisher: World Scientific
Keywords: Geometric graph; Triangulation; Convex complete graph; Convex skewness
Depositing User: Mohamad Jefri Mohamed Fauzi
Date Deposited: 12 Jan 2023 06:38
Last Modified: 12 Jan 2023 06:38
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1142/S1793830921501469
URI: http://psasir.upm.edu.my/id/eprint/93441
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item