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...

全面介紹

Saved in:
書目詳細資料
主要作者: Aziez Rachmansyah, Kemal
格式: Final Project
語言:Indonesia
在線閱讀:https://digilib.itb.ac.id/gdl/view/47751
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!

相似書籍