| 引用本文： |
-
苏凤婷,唐高华,黄立强.树图中进攻性联盟的顶点数上界[J].广西科学,2008,15(4):350-351. [点击复制]
- SU Feng-ting,TANG Gao-hua,HUANG Li-qiang.Offensive Alliance in Tree Graphs[J].Guangxi Sciences,2008,15(4):350-351. [点击复制]
|
|
| 摘要: |
| 给出简单连通树图中进攻性联盟的顶点数α0(T(G))的上界(2τ(G))/3,强进攻性联盟的顶点数α0(T(G))的上界(5τ(G))/6,全面进攻性联盟的顶点数γ0(T(G))的上界⎣(2τ(G))/3⎦及全面强进攻性联盟的顶点数γ0(T(G))的上界⎣(5τ(G))/6⎦. |
| 关键词: 树图 进攻性联盟 顶点数 |
| DOI： |
| 投稿时间：2008-07-09修订日期：2008-07-09 |
| 基金项目:国家自然科学基金项目(项目编号:10771095);广西科学基金项目(项目编号:0575052);广西研究生创新计划项目(项目编号:200610603070M05,2007106030701M05);广西教育厅科研基金项目资助 |
|
| Offensive Alliance in Tree Graphs |
|
SU Feng-ting, TANG Gao-hua, HUANG Li-qiang
|
| (Department of Mathematics and Computer Science, Guangxi Teachers Education University, Nanning, Guangxi, 530001, China) |
| Abstract: |
| The mathematical propertices of the offensive alliance number α0 (T (G)), the strong offensive alliance number α0 (T (G)), the global alliance number γ0 (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⎦. |
| Key words: tree graph offensive alliance alliance number |
