西南师范大学学报（自然科学版）
西南師範大學學報（自然科學版）
서남사범대학학보（자연과학판）
JOURNAL OF SOUTHWEST CHINA NORMAL UNIVERSITY
2009年
5期
22-24
,共3页
主图%模型图%积图%点连通度
主圖%模型圖%積圖%點連通度
주도%모형도%적도%점련통도
main graph%pattern graph%product graph%connectivity
研究了积图的点连通度,并给出了积图点连通度的一个新的下界:设G_m和G_p分别是构成积图G_m*G_p的主图与模型图,若G_m是一个有m个点的连通图,则κ(G_m*G_p)≥min{mκ(G_p),δ(G_p)+1}.
研究瞭積圖的點連通度,併給齣瞭積圖點連通度的一箇新的下界:設G_m和G_p分彆是構成積圖G_m*G_p的主圖與模型圖,若G_m是一箇有m箇點的連通圖,則κ(G_m*G_p)≥min{mκ(G_p),δ(G_p)+1}.
연구료적도적점련통도,병급출료적도점련통도적일개신적하계:설G_m화G_p분별시구성적도G_m*G_p적주도여모형도,약G_m시일개유m개점적련통도,칙κ(G_m*G_p)≥min{mκ(G_p),δ(G_p)+1}.
The connectivity of the product graph is studied, and a new lower bound of the connectivity of the product graph is obtained. Let G_m and G_p be the main graph and the pattern graph of the product graph G_m * G_p, respectively. If G_m is connected and has order m, then κ(G_m * G_p)≥min{mκ(G_p),δ(G_p)+1}.
