The 4-star graph is not a subgraph of any hypercube

Increasing the connectivity of the star graphs

“…Routing algorithms in star graphs and their directed counterparts such as faulttolerant routing, broadcasting, and disjoint paths routing are addressed in [9,12,16,18,19,22,24,27]. Other structural properties and efficient algorithms are given in [2,6,8,23,26]. In particular, [8] studied vulnerability issues for these networks.…”

Packet Routing in Fixed-Connection Networks: A Survey

“…nodes, degree n&1, and diameter w3(n&1)Â2x. Although both the star-graph and the hypercube are Cayley graphs, they are topologically different [284].…”

Linearly many faults in Cayley graphs generated by transposition trees

“…These graph models were generalized and studied in the form of arrangement graphs [22], (n, k)-star graphs [21] and hyperstars [29]. Most of the studies can be classified as one of the following categories: routing properties such as [8,23,24,32], topological properties such as [4,25,31,35], hamiltonicity such as [27,5,26,30], structural properties such as [6,10,14,20], and unidirectional interconnection networks [9,11,12,15,34]. Most of the research is still concentrated on the star graphs.…”