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...
Guardat en:
Autors principals: | Đỗ, Như An, Nguyễn, Đình Ái |
---|---|
Format: | Bài viết |
Idioma: | English |
Publicat: |
Trường Đại học Đà Lạt
2012
|
Matèries: | |
Accés en línia: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/33628 |
Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Ítems similars
-
4-Regular graph of diameter 2 /
per: Do Nhu An. -
4-regular graph of diameter 2
per: Do, Nhu An, et al.
Publicat: (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
per: Do, Nhu An, et al.
Publicat: (2024) -
The L(2, 1)-labeling problem on oriented regular grids /
per: Calamoneri, Tiziana. -
New benchmarks for large-scale networks with given maximum degree and diameter /
per: Loz, Eyal.