UPPER BOUND FOR EXPANSION RATE IN FINITE AND CONNECTED GRAPH
Expansion rate in finite and connected graph for a set of vertices is the least integer of the number of edges so that the neighborhood around that set of vertices have at least half the graphs weight. This study is intended to find the upper bound expansion rate which depends only on the graph a...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Final Project |
| اللغة: | Indonesia |
| الوصول للمادة أونلاين: | https://digilib.itb.ac.id/gdl/view/47751 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | Institut Teknologi Bandung |
| اللغة: | Indonesia |