| 徐连诚,杨元生,夏尊铨.路径幂图、Flower Snark图及多锥图独立数[J].,2010,(2):309-312 |
| 路径幂图、Flower Snark图及多锥图独立数 |
| Independence number of path power, Flower Snark and multi-cone graphs |
| |
| DOI：10.7511/dllgxb201002027 |
| 中文关键词: 独立集 独立数 路径幂图 Flower Snark 多锥图 |
| 英文关键词: independent set independence number path power graph Flower Snark multi-cone graph\@ |
| 基金项目:国家自然科学基金资助项目(90612003). |
|
| 摘要点击次数: 1396 |
| 全文下载次数: 872 |
| 中文摘要: |
| 图的独立数是图论中的重要参数，令 G=(V(G), E(G)) 是一个简单有限无向图．如果V(G)的子集S中任意两个顶点均不相邻，则S是图G的一个独立集．顶点独立集大小的最大值，称为图G的独立数，记做α(G)． 研究了路径幂图、Flower Snark及其相关图、多锥图的独立数问题，首先构造出了它们的独立集，得到其独立数的下界，然后证明了该值也是其独立数的上界，并给出了它们独立数的准确值． |
| 英文摘要: |
| Independence number of the graph is an important parameter in graph theory. Let G=(V(G), E(G)) be a simple finite undirected graph. A sub-set S of V(G) is an independent set and any two vertices of S aren′t adjacent. So the independence number α(G) is the maximum cardinality of an independent set in G . The independence number of path power graph, Flower Shark and its related graph, multi-cone graph is studied. Firstly, the independent sets of them are constructed, so their lower bounds of the independence number are obtained. Secondly, it is proved that these bounds are also the upper bounds of those three graphs. Then, their exact values of the independence number are given. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |
|
|
|