On the Connectivity of Some Telecommunications Networks
Amar · IEEE Transactions on Computers · 1983
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.