×

On minimal directed strongly regular Cayley graphs over dihedral groups. (English) Zbl 07894884

Summary: Let \(\mathcal{G}\) denote a dihedral group, where 1 is identity element and \(T \subseteq \mathcal{G} \setminus \{1\}\). We define \(T\) as minimal if \(T\) satisfies the condition \(\langle T \rangle = \mathcal{G}\), and there is an element \(s \in T\) satisfying \(\langle T \setminus \{s, s^{-1}\} \rangle \neq \mathcal{G}\). Within this manuscript, we achieve a complete characterization of the directed strongly regular Cayley graph \(\operatorname{Cay}(\mathcal{G},T)\) of \(\mathcal{G}\), given the constraint that the subset \(T\) is minimal.

MSC:

05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
05E30 Association schemes, strongly regular graphs
Full Text: DOI

References:

[1] Brouwer, A. E.; Haemers, W. H., Spectra of Graphs, 2011, Springer
[2] Duval, A. M., A directed graph version of strongly regular graphs, J. Comb. Theory, Ser. A, 47, 1, 71-100, 1988 · Zbl 0642.05025
[3] Huang, X.; Das, K. C., On distance-regular Cayley graphs of generalized dicyclic groups, Discrete Math., 345, Article 112984 pp., 2022 · Zbl 1491.05197
[4] Jørgensen, L. K., Directed strongly regular graphs with \(\mu = \lambda \), Discrete Math., 231, 289-293, 2001 · Zbl 0979.05114
[5] Miklavič, Š.; Šparl, P., On minimal distance-regular Cayley graphs of generalized dihedral groups, Electron. J. Comb., 27, 4, Article #P4.33 pp., 2020 · Zbl 1453.05046
[6] Miklavič, Š.; Šparl, P., On distance-regular Cayley graphs on abelian groups, J. Comb. Theory, Ser. B, 108, 102-122, 2014 · Zbl 1297.05112
[7] Sabidussi, G., Graph multiplication, Math. Z., 72, 446-457, 1960 · Zbl 0093.37603
[8] Stevanović, D., Distance regularity of compositions of graphs, Appl. Math. Lett., 17, 337-343, 2004 · Zbl 1063.05137
[9] Vizing, V. G., The Cartesian product of graphs, Vyčisl. Sist., 9, 30-43, 1963 · Zbl 0194.25203
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.