Written on the Wall II - Conjecture 327 #
Reference: E. DeLaVina, Written on the Wall II, Conjectures of Graffiti.pc
theorem
WrittenOnTheWallII.GraphConjecture327.conjecture327
{α : Type u_1}
[Fintype α]
[DecidableEq α]
(G : SimpleGraph α)
[DecidableRel G.Adj]
(hG : G.Connected)
(h : 3 * G.dominationNumber = G.indepDominationNumber)
:
WOWII Conjecture 327
Let G be a simple connected graph. If 3 · γ(G) = γ_i(G), then G is well
totally dominated, where γ(G) is the domination number of G and γ_i(G) is
the independent domination number of G.