摘要
用iκ>0和iδ表示图Gi(i=1,2)的连通度和最小度,给出了无向图强乘积的连通度一个下界:κ(G1G2)≥min{1κ(1+2δ),2κ(1+1δ)}.
The symbols κi, δi are used to denote the connectivity and the minimum degree of a graph Gi for i = 1,2. κ（G1（□×）G2 ） ≥ min{κ1 （1 ＋ δ2 ） ,κ2 （1 ＋ δ1 ） } is established if G1 and G2 are connected undirected graphs, where G1（□×）G2 is the strong product of G1 and G2.
基金
Supported by NNSF of China(10271114).
关键词
图
连通度
强乘积图
最小度
graph
connectivity
strong product graphs
minimum degree
