Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
graph |
| gptkbp:degree |
d
|
| gptkbp:diameter |
n
|
| gptkbp:hasApplication |
distributed systems
communication networks |
| gptkbp:hasEdgeSet |
edges from string s1...sn to s2...snx where x ≠ sn
|
| gptkbp:hasProperty |
minimal diameter for given degree and number of vertices
|
| gptkbp:hasVertexSet |
all strings of length n over an alphabet of size d+1 with no two consecutive characters equal
|
| gptkbp:heldBy |
graph
regular graph vertex-transitive graph |
| https://www.w3.org/2000/01/rdf-schema#label |
Kautz graph
|
| gptkbp:namedAfter |
gptkb:William_H._Kautz
|
| gptkbp:relatedTo |
gptkb:de_Bruijn_graph
|
| gptkbp:usedFor |
interconnection networks
routing algorithms |
| gptkbp:usedIn |
gptkb:network_protocol
computer science parallel computing |
| gptkbp:bfsParent |
gptkb:de_Bruijn_graph
|
| gptkbp:bfsLayer |
7
|