Note on relative Cayley graphs of groups and its complement

The relative Cayley graph of group [Formula: see text] with respect to its proper subgroup [Formula: see text] is the simple undirected graph with vertex set [Formula: see text] in which two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if [Formula: see text] for some [Formula: see text] where [Formula: see text] is an inversed-closed subset of [Formula: see text]. In this paper, we give a necessary and sufficient condition for [Formula: see text] to be bipartite, complete bipartite, complete, connected, self-centered, star graph, and vertex pancyclic. Also, we give a necessary and sufficient condition for [Formula: see text] to be Eulerian.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2025-05-08
DOI
https://doi.org/10.1142/s1793830925500880
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Note on relative Cayley graphs of groups and its complement

A. Manisekar, M. Navaneethakrishnan, S. Anukumar Kathirvel, M. Balamurugan
Discrete Mathematics Algorithms and Applications
Finite Group Theory Research
article

Note on relative Cayley graphs of groups and its complement

A. Manisekar, M. Navaneethakrishnan, S. Anukumar Kathirvel, M. Balamurugan
article en

Abstract

The relative Cayley graph of group [Formula: see text] with respect to its proper subgroup [Formula: see text] is the simple undirected graph with vertex set [Formula: see text] in which two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if [Formula: see text] for some [Formula: see text] where [Formula: see text] is an inversed-closed subset of [Formula: see text]. In this paper, we give a necessary and sufficient condition for [Formula: see text] to be bipartite, complete bipartite, complete, connected, self-centered, star graph, and vertex pancyclic. Also, we give a necessary and sufficient condition for [Formula: see text] to be Eulerian.

Discrete Mathematics Algorithms and Applications
Government Medical College Thoothukudi (IN), ASA College (US), Amrita Vishwa Vidyapeetham (IN)
Openalex Percentile: Top 85%
Finite Group Theory Research
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.