冠图与边冠图的完整度(英文)

阿依古丽·马木提; 秦学姣

您当前的位置：

首页 >

文章列表页 >

冠图与边冠图的完整度(英文)

数理科学 | 更新时间：2026-01-21

- 冠图与边冠图的完整度(英文)
- 冠图与边冠图的完整度(英文)
- 新疆大学学报（自然科学版中英文） 2013年30卷第3期页码：278-281
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
- DOI：
  中图分类号： O157.5
- 纸质出版：2013
- 稿件说明：
移动端阅览
[1]阿依古丽·马木提,秦学姣.冠图与边冠图的完整度(英文)[J].新疆大学学报(自然科学版),2013,30(03):278-281.

阿依古丽·马木提, 秦学姣. 冠图与边冠图的完整度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2013, 30(3): 278-281.
[1]阿依古丽·马木提,秦学姣.冠图与边冠图的完整度(英文)[J].新疆大学学报(自然科学版),2013,30(03):278-281. DOI：

阿依古丽·马木提, 秦学姣. 冠图与边冠图的完整度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2013, 30(3): 278-281. DOI：

摘要

非完全连通图G的完整度可用来检测一个网络的脆弱性且被定义为I(G)=min{|S|+τ(G S)}

其中S和τ(G S)分别指V的子集和G S最大连通分支的阶.G1和G2的冠图

记为G1G2

被构成G1的一个拷贝和G2的|V(G1)|个拷贝

且G1的第i个顶点与G2的第i个拷贝的每个顶点相连.G1和G2的边冠图

记为G1G2

被构成G1的一个拷贝和G2的|E(G1)|个拷贝

且G1的第i条边的两个端点与G2的第i个拷贝的每个顶点相连.在本文中给出了当G1是路

圈

轮

星完全图和树时

冠图和边冠图的完整度.

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 | +τ(G-S)}

where S and τ(G-S) denote the subset of V and the order of the largest component of G- S

respectively. The corona of two graphs G1and G2

written as G1?G2

is the graph obtaining by taking one copy of G1and | V(G1) | copies of G2

and then joining the i-th vertex of G1to every vertex in the i-th copy of G2. The edge corona of two graphs G1and G2

written as G1 G2

is the graph obtaining by taking one copy of G1and | E(G1) | copies of G2

and then joining two end-vertices of the i-th edge of G1to every vertex in the i-th copy of G2. In this paper

we investigate the integrity of the corona and edge corona of two graphs

when G1belongs to some families as paths

cycles

wheels

stars complete graphs and tree.

关键词

Keywords

references

Bondy J A,Murty U S R.Graph theory with Applications[M].NewYork:Macmillan,London and Elsevier,1976.

Boesch F T,Satyanarayana A,Sufel C L.A survey of some network reliability analysis and synthesis results[J].Networks,2009,54(2):99-107.

Mamu A,Vumar E.Vertex vulnerability parameters of kronecker products of complete graphs[J].Inform.Process Lett,2008,106:258-262.

Casablance R M,Dianez A,Garaia-Vazqnez P.Toughness of the corona of two graphs[J].Int J Comput,2011,13:2697-2706.

Bagga K S,Beineke L W,Goddard L,Wet al.A Survey of Integrity[J].Discrete Applied Math,1992,(37-38):13-28.

Mamut A,Vumar E.A Note on the Integrity of Middle Graphs[J].LNCS,2007,4381:130-134.

Mamut A,Vumar E,Bian H.Scattering number of the product of some special classes of graphs[J].Journal of Xinjiang university,2007,24(2):159-165.

Vecdi,Aytac.Computing the Tenacity of Some Graphs[J].Selcuk J Appl Math,2009,10(1):107-120.

Clark L H,Entringer R C,Fellows M.Computational complexity of integrity[J].J Combin Math Combin Comput,1987,2:179-191.

Frucht R,Harary F.On the corona of two graphs[J].Aequationes Math,1970,4:322-325.

Barrientos C.Graceful labelings of chain and corona graphs[J].Bullention of ICA,2002,34:17-26.

Lai Y L,Chang G J.On the profile of the corona of two graphs[J].Inform Process lett,2004,89:287-292.

ShaKhatreh M,AL-Rhayyel A.On the basis number of the corona of graphs[J].Inter J Math Math Sci,2006,10:1-3.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

双图的一些脆弱性参数(英文)