On the fault-diameter of the star graph
From MaRDI portal
Publication:1261488
DOI10.1016/0020-0190(93)90060-MzbMath0773.68058MaRDI QIDQ1261488
Publication date: 25 October 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Connectivity (05C40)
Related Items (26)
Node-to-set disjoint paths problem in star graphs ⋮ A study of fault tolerance in star graph ⋮ Cycle embedding in star graphs with conditional edge faults ⋮ Node-to-node cluster fault tolerant routing in star graphs ⋮ The largest component of faulty star graphs ⋮ Minimum time broadcast in faulty star networks ⋮ Edge-fault diameter of \(C_4\)-free graphs ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees ⋮ Diagnosability of star graphs with missing edges ⋮ Substar reliability analysis in star networks ⋮ Fault-free mutually independent Hamiltonian cycles of faulty star graphs ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ Robustness of star graph network under link failure ⋮ Hamiltonian-laceability of star graphs ⋮ The super connectivity of the pancake graphs and the super laceability of the star graphs ⋮ Improving bounds on link failure tolerance of the star graph ⋮ Deterministic Models of Communication Faults ⋮ Embedding cycles of various lengths into star graphs with both edge and vertex faults ⋮ On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups ⋮ Path embedding in star graphs ⋮ Scheduling of independent jobs in star graph networks ⋮ Short containers in Cayley graphs ⋮ Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs ⋮ Fault-tolerant routing in circulant networks and cycle prefix networks ⋮ Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
Cites Work
This page was built for publication: On the fault-diameter of the star graph
