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 G...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Dalat University
2013-06-01
|
| Series: | Tạp chí Khoa học Đại học Đà Lạt |
| Subjects: | |
| Online Access: | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/245 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832570855417184256 |
|---|---|
| author | Đỗ Như An Nguyễn Đình Ái |
| author_facet | Đỗ Như An Nguyễn Đình Ái |
| author_sort | Đỗ Như An |
| collection | DOAJ |
| 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 n4 be maximum integer number so that there exists an 4-regular graph on n4 vertices of diameter 2. We prove that n4 = 15. |
| format | Article |
| id | doaj-art-c701c9e7cbfe45a98c897b6c505a094b |
| institution | Kabale University |
| issn | 0866-787X |
| language | English |
| publishDate | 2013-06-01 |
| publisher | Dalat University |
| record_format | Article |
| series | Tạp chí Khoa học Đại học Đà Lạt |
| spelling | doaj-art-c701c9e7cbfe45a98c897b6c505a094b2025-02-02T13:51:50ZengDalat UniversityTạp chí Khoa học Đại học Đà Lạt0866-787X2013-06-013210.37569/DalatUniversity.3.2.245(2013)4-REGULAR GRAPH OF DIAMETER 2Đỗ Như An0Nguyễn Đình Ái1Faculty of Information Technology, Nhatrang UniversityFaculty of Information Technology, Nhatrang UniversityA 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 n4 be maximum integer number so that there exists an 4-regular graph on n4 vertices of diameter 2. We prove that n4 = 15.https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/245Regular graphStrongly regular graphDiameter of graph. |
| spellingShingle | Đỗ Như An Nguyễn Đình Ái 4-REGULAR GRAPH OF DIAMETER 2 Tạp chí Khoa học Đại học Đà Lạt Regular graph Strongly regular graph Diameter of graph. |
| title | 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_short | 4-REGULAR GRAPH OF DIAMETER 2 |
| title_sort | 4 regular graph of diameter 2 |
| topic | Regular graph Strongly regular graph Diameter of graph. |
| url | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/245 |
| work_keys_str_mv | AT đonhuan 4regulargraphofdiameter2 AT nguyenđinhai 4regulargraphofdiameter2 |