Thông tin tài liệu
Thông tin siêu dữ liệu biểu ghi
| Trường DC | Giá trị | Ngôn ngữ |
|---|---|---|
| dc.contributor.author | Pranava K., Jha | - |
| dc.date.accessioned | 2023-03-31T08:59:02Z | - |
| dc.date.available | 2023-03-31T08:59:02Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.uri | https://link.springer.com/article/10.1007/s11227-023-05181-8 | - |
| dc.identifier.uri | https://dlib.phenikaa-uni.edu.vn/handle/PNK/7401 | - |
| dc.description | CC BY | vi |
| dc.description.abstract | The quad-cube is a special case of the metacube that itself is derivable from the hypercube. It is amenable to an application as a network topology, especially when the node size exceeds several million. This paper presents the following welcome properties of the graph, relating to its structure: (1) vertex transitivity that facilitates the working of an algorithm meant for a “local” context in the global context as well, and (2) an exact formula for the distance metric, which leads to a precise result on the distance-wise vertex distribution of the graph and an exact formula for the average vertex distance. | vi |
| dc.language.iso | en | vi |
| dc.publisher | Springer | vi |
| dc.subject | metacube | vi |
| dc.subject | hypercube | vi |
| dc.title | Vertex transitivity and distance metric of the quad-cube | vi |
| dc.type | Book | vi |
| Bộ sưu tập | OER - Công nghệ thông tin | |
Danh sách tệp tin đính kèm:
