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...
Na minha lista:
Principais autores: | Đỗ, Như An, Nguyễn, Đình Ái |
---|---|
Formato: | Bài viết |
Idioma: | English |
Publicado em: |
Trường Đại học Đà Lạt
2012
|
Assuntos: | |
Acesso em linha: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/33628 |
Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
Registros relacionados
-
4-Regular graph of diameter 2 /
por: Do Nhu An. -
4-regular graph of diameter 2
por: Do, Nhu An, et al.
Publicado em: (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
por: Do, Nhu An, et al.
Publicado em: (2024) -
The L(2, 1)-labeling problem on oriented regular grids /
por: Calamoneri, Tiziana. -
New benchmarks for large-scale networks with given maximum degree and diameter /
por: Loz, Eyal.