On the problem of determining which (n, k)-star graphs are Cayley graphs

DOI10.1007/S00373-016-1741-8MaRDI QIDQ2361079zbMATH OpenOpenAlexFDO

Authors Eddie Cheng, Li Li, L. Lipták, Daniel E. Steffy, Sangho Shim

Publication date 29 June 2017

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-016-1741-8

zbMATH Keywords

\((n, k)\)-star graphsCayley graphsinterconnection networksvertex-forwarding index

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• A complete classification of which (n,k)-star graphs are Cayley graphs
• Small cycles in the star graph
• scientific article; zbMATH DE number 5139492
• Strong local diagnosability of (n,k)-star graphs and Cayley graphs generated by 2-trees with missing edges
• Fault resiliency of Cayley graphs generated by transpositions

Cites work

• \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
• A study of fault tolerance in star graph
• An efficient algorithm for k-pairwise disjoint paths in star graphs
• Bipancyclic properties of Cayley graphs generated by transpositions
• Cluster fault-tolerant routing in star graphs
• Congestion-free, dilation-2 embedding of complete binary trees into star graphs
• Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
• Distance formula and shortest paths for the \((n,k)\)-star graphs
• Edge-foreward index of star graphs and other Cayley graphs
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Fault tolerant routing in the star and pancake interconnection networks
• Generalized connectivity of (n,k)-star graphs
• scientific article; zbMATH DE number 1382490 (Why is no real title available?)
• scientific article; zbMATH DE number 3689291 (Why is no real title available?)
• scientific article; zbMATH DE number 839542 (Why is no real title available?)
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• Hyper Hamiltonian laceability on edge fault star graph
• Increasing the connectivity of the star graphs
• Linearly many faults in (n,k)-star graphs
• Minimal factorizations of permutations into star transpositions
• On a Class of Fixed-Point-Free Graphs
• On forwarding indices of networks
• On the genus of star graphs
• On the surface area of the (n,k)-star graph
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• Orienting Cayley graphs generated by transposition trees
• Strong local diagnosability of (n,k)-star graphs and Cayley graphs generated by 2-trees with missing edges
• The (n,k)-star graph: A generalized star graph
• The 4-star graph is not a subgraph of any hypercube
• The forwarding index of communication networks
• The number of shortest paths in the (n, k)-star graph
• VLSI layouts of complete graphs and star graphs
• Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness

Cited in

(3)

• A complete classification of which (n,k)-star graphs are Cayley graphs
• A brief account on the development and future research directions of connectivity properties of interconnection networks
• A note of independent number and domination number of \(Q_{n, k, m}\)-graph

This page was built for publication: On the problem of determining which \((n, k)\)-star graphs are Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361079)