Generalized cayley graphs and group structure: Insights from the direct products of P₂ and C₃

This work introduces a generalization of Cayley graphs, denoted Cay m (, S), where is a finite group and S is a non-empty subset of .In this construction, vertices are represented by m-dimensional column vectors with entries in , and adjacency is determined by a matrix-based condition involving the inverse elements and a matrix of elements from S. We focus on elucidating the structure and fundamental properties of Cay m (, S) when the classical Cayley graph Cay(, S) corresponds to the direct products P 2 P 2 and P 2 C 2 .Through rigorous analysis, we reveal distinct structural characteristics arising from these specific group structures and their associated generating sets.The generalized Cayley graph, denoted as Cay m (, S), is a graph where the vertex set consists of all column matrices X m , with each matrix having elements from the set . Two vertices X m and Y m are adjacent if and only if Y m -1 , the inverse of Y m , is a column matrix where each entry corresponds to the inverse of the associated element in .Our findings provide valuable insights into the interplay between algebraic properties of groups and the topological features of their generalized Cayley graph representations.This study contributes to a deeper understanding of generalized Cayley graphs and their potential applications in diverse fields such as network theory, coding theory, and cryptography.

Publication Details

Journal
Results in Nonlinear Analysis
Published
2025-01-01
DOI
https://doi.org/10.31838/rna/2024.08.01.003
Primary Topic
Synthesis and characterization of novel inorganic/organometallic compounds
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalized cayley graphs and group structure: Insights from the direct products of P₂ and C₃

Results in Nonlinear Analysis
Synthesis and characterization of novel inorganic/organometallic compounds
article

Generalized cayley graphs and group structure: Insights from the direct products of P₂ and C₃

article en

Abstract

This work introduces a generalization of Cayley graphs, denoted Cay m (, S), where is a finite group and S is a non-empty subset of .In this construction, vertices are represented by m-dimensional column vectors with entries in , and adjacency is determined by a matrix-based condition involving the inverse elements and a matrix of elements from S. We focus on elucidating the structure and fundamental properties of Cay m (, S) when the classical Cayley graph Cay(, S) corresponds to the direct products P 2 P 2 and P 2 C 2 .Through rigorous analysis, we reveal distinct structural characteristics arising from these specific group structures and their associated generating sets.The generalized Cayley graph, denoted as Cay m (, S), is a graph where the vertex set consists of all column matrices X m , with each matrix having elements from the set . Two vertices X m and Y m are adjacent if and only if Y m -1 , the inverse of Y m , is a column matrix where each entry corresponds to the inverse of the associated element in .Our findings provide valuable insights into the interplay between algebraic properties of groups and the topological features of their generalized Cayley graph representations.This study contributes to a deeper understanding of generalized Cayley graphs and their potential applications in diverse fields such as network theory, coding theory, and cryptography.

Results in Nonlinear AnalysisVol. 8(1)
Openalex Percentile: Top 84%
Synthesis and characterization of novel inorganic/organometallic compounds
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.