Domination in the Negation of Cayley Signed Graphs

In this paper, the authors study the concept of domination in the negation of Cayley signed graphs over finite abelian groups. They establish sharp bounds for the domination numbers and characterize the groups that attain these bounds. The study reveals that, for certain Cayley sets, the sum of the domination numbers of a Cayley signed graph and its negation exceeds the group’s order. The results are illustrated with several examples.

Authors

Institutions

Publication Details

Journal
Journal of Interconnection Networks
Published
2026-04-24
DOI
https://doi.org/10.1142/s0219265926500088
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Domination in the Negation of Cayley Signed Graphs

Amit Kumar, Pranjali, Anjali Gautam
Journal of Interconnection Networks
Advanced Graph Theory Research
article

Domination in the Negation of Cayley Signed Graphs

Amit Kumar, Pranjali, Anjali Gautam
article en

Abstract

In this paper, the authors study the concept of domination in the negation of Cayley signed graphs over finite abelian groups. They establish sharp bounds for the domination numbers and characterize the groups that attain these bounds. The study reveals that, for certain Cayley sets, the sum of the domination numbers of a Cayley signed graph and its negation exceeds the group’s order. The results are illustrated with several examples.

Journal of Interconnection Networks
Banasthali University (IN), University of Rajasthan (IN)
Reduced inequalities
Openalex Percentile: Top 5%
Advanced Graph 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.