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...
保存先:
主要な著者: | Đỗ, Như An, Nguyễn, Đình Ái |
---|---|
フォーマット: | Bài viết |
言語: | English |
出版事項: |
Trường Đại học Đà Lạt
2012
|
主題: | |
オンライン・アクセス: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/33628 |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
類似資料
-
4-Regular graph of diameter 2 /
著者:: Do Nhu An. -
4-regular graph of diameter 2
著者:: Do, Nhu An, 等
出版事項: (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
著者:: Do, Nhu An, 等
出版事項: (2024) -
The L(2, 1)-labeling problem on oriented regular grids /
著者:: Calamoneri, Tiziana. -
New benchmarks for large-scale networks with given maximum degree and diameter /
著者:: Loz, Eyal.