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: | , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
Trường Đại học Đà Lạt
2012
|
| Những chủ đề: | |
| Truy cập trực tuyến: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/33628 |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| id |
oai:scholar.dlu.edu.vn:DLU123456789-33628 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scholar.dlu.edu.vn:DLU123456789-336282012-12-26T00:56:37Z 4-Regular graph of diameter 2 Đỗ, Như An Nguyễn, Đình Ái Regular graph Strongly regular graph diameter of graph 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 . 2012-12-26T00:56:37Z 2012-12-26T00:56:37Z 2012 Working Paper https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/33628 en Kỷ yếu Hội thảo công nghệ thông tin 2012;tr. 7-14 application/pdf Trường Đại học Đà Lạt |
| institution |
Thư viện Trường Đại học Đà Lạt |
| collection |
Thư viện số |
| language |
English |
| topic |
Regular graph Strongly regular graph diameter of graph |
| spellingShingle |
Regular graph Strongly regular graph diameter of graph Đỗ, Như An Nguyễn, Đình Ái 4-Regular graph of diameter 2 |
| description |
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
. |
| format |
Working Paper |
| author |
Đỗ, Như An Nguyễn, Đình Ái |
| author_facet |
Đỗ, Như An Nguyễn, Đình Ái |
| author_sort |
Đỗ, Như An |
| title |
4-Regular graph of diameter 2 |
| title_short |
4-Regular graph of diameter 2 |
| title_full |
4-Regular graph of diameter 2 |
| title_fullStr |
4-Regular graph of diameter 2 |
| title_full_unstemmed |
4-Regular graph of diameter 2 |
| title_sort |
4-regular graph of diameter 2 |
| publisher |
Trường Đại học Đà Lạt |
| publishDate |
2012 |
| url |
https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/33628 |
| _version_ |
1819794653266837504 |