2020/11/10 by Mohammad A. Iranmanesh, Iranmanesh, Mohammad A., Nasrin Moghaddami +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2011.05753
openalex publication_date 2020/11/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let Σ=(Γ, σ) is a signed graph(or sigraph in short), where Γ is a underlying graph of Σ and σ:E\longrightarrow \+, -\ is a function. Consider Γ=Cay(ℤ_p1× ℤ_p1^α1p2^α2 … pk^αk, Φ), where all p1, p2, …, pk are distinct prime factors and Φ=φ_p1×φ_p1^α1p2^α2 … pk^αk. For any positive integer n, φn=\ℓ| 1≤ ℓ