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...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Bài viết |
| Jazyk: | English |
| Vydáno: |
Trường Đại học Đà Lạt
2012
|
| Témata: | |
| On-line přístup: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/33628 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| Shrnutí: | 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
. |
|---|