On the Connectivity of Some Telecommunications Networks

1 May 1983

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-32 (5) , 512-519
https://doi.org/10.1109/TC.1983.1676267

Abstract

Memmi and Raillard constructed two families of graphs, regular of degree d and diameter k which are useful for designing telecommunications networks ([(d, k) graph problem]). They conjectured that the connectivity of these graphs were equal to their degree. We prove here these conjectures, that implies that the networks have the best possible reliability.

Keywords

GRAPHS
CONJECTURES
DESIGNING TELECOMMUNICATIONS
TELECOMMUNICATIONS NETWORKS MEMMI
MEMMI AND RAILLARD

This publication has 2 references indexed in Scilit:

Some New Results About the (d, k) Graph Problem
IEEE Transactions on Computers, 1982
Topological constraints on interconnection-limited logic
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1964