| 两个图的Corona乘积图的完整度研究 |
| |
| 引用本文： | 阿依古丽·马木提,秦学姣. 两个图的Corona乘积图的完整度研究[J]. 新疆大学学报(自然科学维文版), 2013, 0(2): 23-27 |
| |
| 作者姓名： | 阿依古丽·马木提 秦学姣 |
| |
| 摘 要： | 图的完整度／（c）是表示网络的可靠性的重要度量之一。定义为：（G）=mintlsI＋（G—s）}。这里/s/和r（G—s）分别表示图G的顶点集V（G）的子集所包含的点数和G—S的最大连通分支所含的点数。在本文中我们确定了两个图的Corona乘积图和边Corona乘积图的完整度。
|
| 关 键 词： | 完整度 两个图的Corona乘积图 两个图的边Corona图 |
A Note on the Integrity of the Corona and Edge Corona of Two Graphs |
| |
| Aygul Mamut,Qin xuejiao. A Note on the Integrity of the Corona and Edge Corona of Two Graphs[J]. JOURNAL OF XINJIANG UNIVERSITY, 2013, 0(2): 23-27 |
| |
| Authors: | Aygul Mamut Qin xuejiao |
| |
| Abstract: | The integrity I（G） of a non-complete connected graph G is a measure of network invulnerability and is defined by I（G）=min{S /＋t（G-S）}, where S and r （G-S） denote the subset of V and the order of the largest component of G - S, respectively. In this paper, we get the integrity of Corona and edge-corona of two graphs. |
| |
| Keywords: | Integrity Corona of two graphs edge-corona of two graphs |
| 本文献已被 维普 等数据库收录！ |
