×

Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs. (English) Zbl 1330.05055

Summary: J. Bond [Grands réseaux d’interconnexion. Paris: Paris-sud University (PhD thesis) (1987)] and J. Bond et al. [The radius of graphs on alphabets. Rapport de Recherche 156-RR 388, Paris-sud University], conjectured that a quasi-center in an undirected de Bruijn graph \(\mathrm{UB}(d,D)\) has cardinality at least \(d-1\), and that a quasi-center in an undirected Kautz graph \(\mathrm{UK}(d,D)\) has cardinality at least \(d\). They proved that for \(d\geq 3\), the radii of \(\mathrm{UB}(d,D)\) and \(\mathrm{UK}(d,D)\) are both equals to \(D\), and conjectured also that the radii of \(\mathrm{UB}(2,D)\) and \(\mathrm{UK}(2,D)\) are respectively \(D-1\) and \(D\). In this paper we give results in a more general context which validate these conjectures (excepting that asserting that the radius of \(\mathrm{UB}(2,D)\) is \(D-1\)), and give simplified proofs of the cited results.

MSC:

05C12 Distance in graphs
Full Text: DOI

References:

[1] Bond, I., Grands réseaux d’interconnexion (1987), Paris-sud University: Paris-sud University Orsay, (Ph.D. thesis)
[2] Bond, J.; Rudich, S.; Santha, M.; de la Vega, W. F., The radius of graphs on alphabets, Rapport de recherche 388 (1987), Paris-Sud University: Paris-Sud University LRI Orsay
[3] Lichiardopol, Nicolas, Independence number of de Bruijn graphs, Discrete Math., 306, 1145-1160 (2006) · Zbl 1096.05039
[5] Syska, M., Communications dans les architectures à mémoire distribuée (1992), Nice-Sophia Antipolis University, (Ph.D. thesis)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.