4-Regular graph of diameter 2
A regular graph is a graph where each vertex has the same degree. A regular graph with vertices of degree k is called a k -regular graph or regular graph of degree k . Let G be a graph, the distance between two vertices in G is the number of edges in a shortest path connecting them. The diameter of...
Đã lưu trong:
| Những tác giả chính: | , |
|---|---|
| Formáid: | Bài viết |
| Teanga: | English |
| Foilsithe: |
Trường Đại học Đà Lạt
2012
|
| Ábhair: | |
| Rochtain Ar Líne: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/33628 |
| Clibeanna: |
Cuir Clib Leis
Gan Chlibeanna, Bí ar an gcéad duine leis an taifead seo a chlibeáil!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| Achoimre: | A regular graph is a graph where each vertex has the same degree. A regular graph with vertices of degree k is called a k -regular graph or regular graph of degree k . Let G
be a graph, the distance between two vertices in G is the number of edges in a shortest path connecting them. The diameter of G is the greatest distance between any pair of vertices. Let n/4 be maximum integer number so that there exists an 4-regular graph on n/4 vertices of diameter 2. We prove that n4=15
. |
|---|