- Full text PDF available (3)
- This year (0)
- Last 5 years (0)
- Last 10 years (2)
We introduce an enhanced weighted graph model whose vertices and edges have several attributes that make it adaptable to a variety of examination and course time-tabling scenarios. In addition, some new vertex-and colour selection heuristics arise naturally from this model, and our implementation allows for the use and manipulation of various combinations… (More)
The distance-k domination and independent domination numbers for Fibonacci trees are determined, both in terms of Fibonacci numbers and in closed form.