Pulse nav.journalClub Aktive Debatten Trends Entdecken Fragen Forschende

Download the App

Join discussions, follow papers, and never miss your next session.

Download on theApp Store

© Synapse Social LLC, 2026

Start Entdecken nav.journalClub Trends

⌘+K

Domination in 4‐Regular Graphs With No Induced 4‐Cycles | Synapse

March 10, 2026

Domination in 4‐Regular Graphs With No Induced 4‐Cycles

Key Points

The aim is to prove the domination conjecture for 4-regular graphs that lack induced 4-cycles.
Defined a dominating set and the domination number in graph theory.
Analyzed structural properties of 4-regular graphs.
Applied combinatorial techniques to establish proof.
Successfully proved the conjecture in 4-regular graphs.
Demonstrated that the domination number meets the stated condition when no induced 4-cycles are present.

Abstract

ABSTRACT A set of vertices in a graph is a dominating set of if every vertex not in is adjacent to a vertex in . The domination number of , denoted by , is the minimum cardinality of a dominating set in . The ‐conjecture for domination in 4‐regular graphs states that if is a 4‐regular graph of order , then . We prove this conjecture when has no induced 4‐cycle.

Like

Bookmark

Share

Like

Bookmark

Share

Cite This Study

Henning et al. (Fri,) studied this question.

synapsesocial.com/papers/69af953870916d39fea4c970 https://doi.org/https://doi.org/10.1002/jgt.70013