Longest paths and cycles in faulty star graphs
From MaRDI portal
Publication:705576
DOI10.1016/j.jpdc.2004.08.004zbMath1060.05058OpenAlexW2069397966MaRDI QIDQ705576
Publication date: 31 January 2005
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.08.004
Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)
Related Items
Paired many-to-many disjoint path covers in faulty hypercubes, On the construction of all shortest node-disjoint paths in star networks, Edge-bipancyclicity of star graphs with faulty elements, Fault-free mutually independent Hamiltonian cycles of faulty star graphs