QQ客服 官方微博 反馈留言

	n-double图的连通性; Connectivity of n-double Graphs
	郭利涛 ; 覃城阜 ; 郭晓峰
	2013-03-15
关键词	n-double图 (边)连通性 超(边)连通性 n-double graphs (edge)connectivity super(edge)connectivity
英文摘要	设g_1=(V_1,E_1),g_2=(V_2,E_2)是两个连通图,直积(dIrECT PrOduCT)(也称为krOnECkEr PrOduCT,TEnSOr PrOduCT和CrOSS PrOduCT)g_1g_2的点集为V(g_1g_2)=V(g_1)V(g_2),边集为E(g_1g_2)={(u_1,V_1)(u_2,V_2):u_1u_2∈E(g_1),V_1V_2∈E(g_2)).简单图g的n-dOublE图d_n[g]=gT_n,其中n个点的全关系图T_n是完全图k_n在每个点加上一个自环得到的图.在本文中,我们研究了d_n[g]的(边)连通性,超(边)连通性.; Let G =(V,E) be a connected graph.The direct product(also named Kronecker product,tensor product and cross product) G_1×G_2 has vertex set V(G_1×G_2)= V(G_1)×V(G_2) and edge set E(G_1×G_2) = {(u_1,v_1)(u_2,v_2):u_1u_2∈E(G_1),v_1v_2∈E(G_2)}.We define the n-double of a simple graph G as the graph D_n[G]= G×T_n.The total graph T_n on n vertices is the graph associated to the total relation(where every vertex is adjacent to every vertex).It can be obtained from the complete graph K_n by adding a loop to every vertex.In this paper,we study the(edge)connectivity,super(edge)connectivity of D_n[G].; 国家自然科学基金(11171279;11126321;11161006;71201049); 厦门理工学院博士启动金(YKJ12030R); 广西自然科学基金(2012GXNSFBA053005)资助项目
语种	zh_CN
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/119844]
专题	数学科学－已发表论文
推荐引用方式 GB/T 7714	郭利涛,覃城阜,郭晓峰. n-double图的连通性, Connectivity of n-double Graphs[J],2013.
APA	郭利涛,覃城阜,&郭晓峰.(2013).n-double图的连通性..
MLA	郭利涛,et al."n-double图的连通性".(2013).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。