Sufficient condition for Reed's conjecture
Misa Nakanishi
TL;DR
This paper investigates the domination number in cubic graphs and provides a sufficient condition that supports Reed's conjecture, contributing to the understanding of graph domination properties.
Contribution
It introduces a new sufficient condition for Reed's conjecture specifically applied to cubic graphs, advancing theoretical insights in graph theory.
Findings
Identifies a specific condition under which Reed's conjecture holds for cubic graphs.
Provides theoretical proof supporting the conjecture in certain cases.
Enhances understanding of domination number behavior in cubic graphs.
Abstract
From the research of several recent papers, we are concerned with domination number in cubic graphs and give a sufficient condition for Reed's conjecture.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · graph theory and CDMA systems