Tetravalent non-normal Cayley graphs of order 5p^2

Soghra Khazaei, Hesam Sharifi

Abstract


In this paper, we explore connected Cayley graphs on non-abelian groups of order 5p2, where p is a prime greater than 5, and Sylow p-subgroup is cyclic with respect to tetravalent sets that encompass elements with different orders. We prove that these graphs are normal; however, they are not normal edge-transitive, arc-transitive, nor half-transitive. Additionally, we establish that the group is a 5-CI-group.


Keywords


Cayley graph, normal edge-transitive, arc-transitive, graph automorphism, group automorphism

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2024.12.1.8

References

M. Anholcer, M. Kalkowski and J. Przybylo, A new upper bound for the total vertex irregularity strength of graphs, Discrete Math. 309 (2009), 6316–6317.

M. Anholcer, M. Kalkowski and J. Przybylo, A new upper bound for the total vertex irregularity strength of graphs, Discrete Math. 309 (2009), 6316–6317.

S. Brandt, J. Miškuf and D. Rautenbach, On a conjecture about edge irregular total labellings, J. Graph Theory, 57 (2008), 333–343.

G. Chartrand, M.S. Jacobson, J. Lehel, O.R. Oellermann, S. Ruiz and F. Saba, Irregular networks, Congr. Numer. 64 (1988), 187–192.

J. Ivančo and S. Jendroľ, Total edge irregularity strength of trees, Discussiones Math. Graph Theory 26 (2006), 449–456.

S. Jendroľ, J.Miškuf and R. Soták, Total edge irregularity strength of complete and complete bipartite graphs, Electron. Notes Discrete Math. 28 (2007), 281–285.

S. Jendroľ, J.Miškuf, and R. Soták, Total edge irregularity strength of complete graphs and complete bipartite graphs, Discrete Math., 310 (2010), 400–407.


Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats