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 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
UPPER BOUND ESTIMATION OF THE EXPECTATION OF THE NUMBER OF INFECTED NODES AS A RISK FOR CYBER INSURANCE RATE MAKING ON FINITE GRAPHS
由: Antonio, Yeftanus -
An Upper Bound for the Total Restrained Domination Number of Graphs
由: Koh, K.M., et al.
出版: (2014) -
RAINBOW CONNECTION NUMBERS OF SOME GRAPHS OF FINITE GROUPS
由: Febrian Umbara, Rian -
Upper and lower bound solutions for pressure-controlled cylindrical and spherical cavity expansion in semi-infinite soil
由: Zhou, Hang, et al.
出版: (2020) -
Upper and lower bounds for natural frequencies: A property of the smoothed finite element methods
由: Zhang, Z.-Q., et al.
出版: (2014)