تقرير
The overlap number of a graph
| العنوان: | The overlap number of a graph |
|---|---|
| المؤلفون: | Rosgen, Bill, Stewart, Lorna |
| سنة النشر: | 2010 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Discrete Mathematics |
| الوصف: | An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements needed to form such a representation. We find the overlap numbers of cliques and complete bipartite graphs by relating the problem to previous research in combinatorics. The overlap numbers of paths, cycles, and caterpillars are also established. Finally, we show the NP-completeness of the problems of extending an overlap representation and finding a minimum overlap representation with limited containment. Comment: 20 pages, 2 figures |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/1008.2170 |
| رقم الأكسشن: | edsarx.1008.2170 |
| قاعدة البيانات: | arXiv |
كن أول من يترك تعليقا!