Triangulability of convex graphs and convex skewness
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 triangulati...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
World Scientific
2021
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/93441/ https://www.worldscientific.com/doi/10.1142/S1793830921501469 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
my.upm.eprints.93441 |
|---|---|
| record_format |
eprints |
| spelling |
my.upm.eprints.934412023-01-12T06:38:19Z http://psasir.upm.edu.my/id/eprint/93441/ Triangulability of convex graphs and convex skewness Ali, Niran Abbas Chia, Gek L. Trao, Hazim Michman Kilicman, Adem 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. World Scientific 2021 Article PeerReviewed 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 https://www.worldscientific.com/doi/10.1142/S1793830921501469 10.1142/S1793830921501469 |
| institution |
Universiti Putra Malaysia |
| building |
UPM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Putra Malaysia |
| content_source |
UPM Institutional Repository |
| url_provider |
http://psasir.upm.edu.my/ |
| description |
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. |
| format |
Article |
| author |
Ali, Niran Abbas Chia, Gek L. Trao, Hazim Michman Kilicman, Adem |
| spellingShingle |
Ali, Niran Abbas Chia, Gek L. Trao, Hazim Michman Kilicman, Adem Triangulability of convex graphs and convex skewness |
| author_facet |
Ali, Niran Abbas Chia, Gek L. Trao, Hazim Michman Kilicman, Adem |
| author_sort |
Ali, Niran Abbas |
| title |
Triangulability of convex graphs and convex skewness |
| title_short |
Triangulability of convex graphs and convex skewness |
| title_full |
Triangulability of convex graphs and convex skewness |
| title_fullStr |
Triangulability of convex graphs and convex skewness |
| title_full_unstemmed |
Triangulability of convex graphs and convex skewness |
| title_sort |
triangulability of convex graphs and convex skewness |
| publisher |
World Scientific |
| publishDate |
2021 |
| url |
http://psasir.upm.edu.my/id/eprint/93441/ https://www.worldscientific.com/doi/10.1142/S1793830921501469 |
| _version_ |
1755873896155840512 |
| score |
13.160551 |