!!Projects per year
ملخص
The paper introduces a graph theory variation of the general position problem: Given a graph , determine a largest set of vertices of such that no three vertices of lie on a common geodesic. Such a set is a max-gp-set of and its size is the gp-number of . Upper bounds on in terms of different isometric covers are given and used to determine the gp-number of several classes of graphs. Connections between general position sets and packings are investigated and used to give lower bounds on the gp-number. It is also proved that the general position problem is NP-complete.
| اللغة الأصلية | English |
|---|---|
| الصفحات (من إلى) | 177-187 |
| عدد الصفحات | 11 |
| دورية | Bulletin of the Australian Mathematical Society |
| مستوى الصوت | 98 |
| رقم الإصدار | 2 |
| المعرِّفات الرقمية للأشياء | |
| حالة النشر | Published - 1 أكتوبر 2018 |
بصمة
أدرس بدقة موضوعات البحث “A General Position Problem in Graph Theory'. فهما يشكلان معًا بصمة فريدة.المشاريع
- 1 منتهي
-
Graph Theory General Position Problem with applications
Manuel, M. P. D. (PI)
18/12/17 → 17/12/18
المشروع: RESEARCH PROJECT
قم بذكر هذا
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver