NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS

DOI10.1142/S0129054198000076zbMath0967.68009MaRDI QIDQ2703016

No author found.

Publication date: 28 February 2001

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

routingsurviving route graphfixed step graphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR ⋮ Symmetry properties of chordal rings of degree 3 ⋮ A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS ⋮ A SET OF FAMILIES OF ANALYTICALLY DESCRIBED TRIPLE LOOP NETWORKS DEFINED BY A PARAMETER ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Minimum chromaticity of circulant graphs

Cites Work

• Fault-tolerant routings in double fixed-step networks
• A survey of gossiping and broadcasting in communication networks
• EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗

This page was built for publication: NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS