Offensive Alliance in Tree Graphs
Huang Li-qiang · Guangxi kexue · 2008
The mathematical propertices of the offensive alliance number α0(T(G)), the strong offensive alliance number α0(T(G)), the global alliance number γo(T(G)) and the global strong offensive alliance number γ0(T(G)) of the tree graph of a simple connected graph G are given,where α0(T(G)) ≤(2τ(G))/3, α0(TγG))≤(5τ(G))/6,γ0(T(G)) ≤└(2τ(G))/3┘,γ0(T(G))≤└(5τ(G))/6┘