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ư An, Nguyễn, Đình Ái |
---|---|
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 |
---|
Míreanna Comhchosúla
-
4-Regular graph of diameter 2 /
le: Do Nhu An. -
4-regular graph of diameter 2
le: Do, Nhu An, et al.
Foilsithe: (2014) -
CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
le: Do, Nhu An, et al.
Foilsithe: (2024) -
The L(2, 1)-labeling problem on oriented regular grids /
le: Calamoneri, Tiziana. -
New benchmarks for large-scale networks with given maximum degree and diameter /
le: Loz, Eyal.