Global defensive alliances of trees and Cartesian product of graphs
碩士 === 國立東華大學 === 應用數學系 === 95 === We study the global defensive alliance of graphs in this thesis. we give an algorithm to determine the global defensive alliance number of trees, and find γ_{a}(T), when T is a complete k-ary tree for k=2,3,4. We also study the global defensive alliance of the Cart...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/pck3kx |
| Summary: | 碩士 === 國立東華大學 === 應用數學系 === 95 === We study the global defensive alliance of graphs in this thesis. we give an algorithm to determine the global defensive alliance number of trees, and find γ_{a}(T), when T is a complete k-ary tree for k=2,3,4. We also study the global defensive alliance of the Cartesian product of paths and cycles. We give upper bounds and lower bounds for γ_{a}(P_{m}×P_{n}), γ_{a}(C_{m}×P_{n}) and γ_{a}(C_{m}×C_{n}), and show that the bounds are sharp for special m,n
|
|---|