The following pages link to Claudine Peyrat (Q1086584):
Displaying 14 items.
- (Q685655) (redirect page) (← links)
- Connectivity of Kautz networks (Q685656) (← links)
- Diameter vulnerability of graphs (Q800372) (← links)
- Sufficient conditions for maximally connected dense graphs (Q1086585) (← links)
- Large fault-tolerant interconnection networks (Q1120553) (← links)
- Graphs such that every two edges are contained in a shortest cycle (Q1122590) (← links)
- Fault-tolerant routings in Kautz and de Bruijn networks (Q1123801) (← links)
- Broadcasting in a hypercube when some calls fail (Q1182079) (← links)
- A single-copy minimal-time simulation of a torus of automata by a ring of automata (Q2384397) (← links)
- (Q3350798) (← links)
- Induced Subgraphs of the Power of a Cycle (Q3490041) (← links)
- On iterated clique graphs with increasing diameters (Q3728026) (← links)
- Connectivity of Imase and Itoh digraphs (Q3809285) (← links)
- (Q3827949) (← links)