June 6, 2024Open Access

On the Diameter of Undirected Cayley Graphs of Finite Abelian Groups

Puntos clave

Los puntos clave no están disponibles para este artículo en este momento.

Resumen

Let s be a positive integer. Our goal is to find all finite abelian groups G that contain a 2-subset A for which the undirected Cayley graph (G, A) has diameter at most s. We provide a complete answer when G is cyclic, and a conjecture and some partial answers when G is noncyclic.

Leer artículo completoexternamente

Me gusta

Guardar

Ver artículo completo

Cite This Study

Bajnok et al. (Thu,) studied this question.

synapsesocial.com/papers/68e65e3eb6db6435875eceae https://doi.org/https://doi.org/10.48550/arxiv.2406.04045

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1On the diameter of Cayley graphs of classical groups with generating sets containing a transvection2024 · 1 citations
2Cayley graphs on $p$-solvable groups generated by $p$-singular elements2024
3Coloring minimal Cayley graphs2024
4On the k-Spanning Cyclability of 4-Valent Cayley Graphs on Abelian Groups2024
5On structural properties of generalized Cayley graphs2025

Me gusta

Guardar

Ver artículo completo