THE CONNECTED GRAPH OF ORDER n ? 9 WITH DIAMETER 2 AND PARTITION DIMENSION n-3
Let G be a connected graph and u,v ? V(G),u ? v. The distance between two vertices u,v?V(G), denoted by d(u,v), is the length of a shortest path between them. The diameter of G, denoted by diam(G)=max?{d(u,v)|u,v? V(G)}. Let S?V(G) and S={s_1,…,s_k }. For every v?V(G) define the representation r(v|S...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/34185 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |