

浏览全部资源
扫码关注微信
新疆大学数学与系统科学学院
Published:2022
移动端阅览
[1]吴丽芸,田应智.路和圈、圈和圈的Kronecker积图的超点连通性[J].新疆大学学报(自然科学版)(中英文),2022,39(02):176-181.
[1]吴丽芸,田应智.路和圈、圈和圈的Kronecker积图的超点连通性[J].新疆大学学报(自然科学版)(中英文),2022,39(02):176-181. DOI: 10.13568/j.cnki.651094.651316.2021.02.17.0001.
DOI:10.13568/j.cnki.651094.651316.2021.02.17.0001.
如果图G的每一个最小点割都是某个点的邻点集
那么G是超点连通的
或者简称为是super-κ的.图G1与G2的Kronecker积图是一个点集为V (G1×G2)=V (G1)×V (G2)
边集为E(G1×G2)={(u1
v1)(u2
v2):u_1u2∈E(G1)
v_1v2∈E(G2)}的图.本文证明了对整数m≥4和奇数n≥3
Pm×Cn是超点连通的;对整数m≥5和奇数n≥3
Cm×Cn是超点连通的.
A graph G is super connected
or simply super-κ
if every minimum vertex-cut isolates a vertex. The Kronecker product G1 × G2 of graphs G1 and G2 is the graph with vertex set V(G1 × G2) = V(G1) × V(G2) and edge set E(G1 × G2) = {(u1
v1)(u2
v2) : u_1u2 ∈ E(G1)
v_1v2 ∈ E(G2)}. In this paper
we prove that Pm × Cn is super-κ for m ≥ 4
n ≥ 3 and n is odd; Cm × Cn is super-κ for m ≥ 5
n ≥ 3 and n is odd.
BONDY J A,MURTY U S R.Graph theory[M].Berlin:Springer,2008.
MAMUT A,VUMAR E.Vertex vulnerability parameters of Kronecker products of complete graphs[J].Information Processing Letters,2008,106(6):258-262.
GUJI R,VUMAR E.A note on the connectivity of Kronecker products of graphs[J].Applied Mathematics Letters,2009,22(9):1360-1363.
WANG Y,WU B Y D R.Proof of a conjecture on connectivity of Kronecker product of graphs[J].Discrete Mathematics,2011,311(21):2563-2565.
WANG W,XUE N N.Connectivity of direct products of graphs[J].Ars Combinatoria,2011,100:107-111.
GUO L T,QIN C F,GUO X F.Super connectivity of Kronecker products of graphs[J].Information Processing Letters,2010,110(16):659-661.
GUO L T,GUO X F.Super connectivity of Kronecker products of some graphs[J].Ars Combinatoria,2015,123:65-73.
WANG H C,SHAN E F,WANG W.On the super connectivity of Kronecker products of graphs[J].Information Processing Letters,2012,112(10):402-405.
ZHOU J X.Super connectivity of direct product of graphs[J].Ars Mathematica Contemporanea,2015,8(2):235-244.
HOJI M,VUMAR E.Some vertex vulnerability parameters of Kronecker products of complete graphs[J].Journal of Xinjiang University(Natural Science Edition),2010,27(3):276-279.
GUJI R.Anote on the toughness and edge-toughness of Kronecker product of graphs[J].Journal of Xinjiang University(Natural Science Edition),2016,33(4):407-410.
CHIUE W S,SHIEH B S.On connectivity of the Cartesian product of two graphs[J].Applied Mathematics and Computation,1999,102(2/3):129-137.
XU J M,YANG C.Connectivity of Cartesian product graphs[J].Discrete Mathematics,2006,306(1):159-165.
ˇSPACAPAN S.Connectivity of Cartesian products of graphs[J].Applied Mathematics Letters,2008,21(7):682-685.
LYU M,WU C,CHEN G L,et al.On super connectivity of Cartesian product graphs[J].Networks,2008,52(2):78-87.
TIAN Y Z,MENG J X.Restricted connectivity for some interconnection networks[J].Graphs and Combinatorics,2015,31(5):1727-1737.
CHEN L H,MENG J X,TIAN Y Z.Cyclic vertex connectivity of Cartesian product graphs[J].Chinese Annals of Mathematics,2016,37(2):155-170.
QIN D J,TIAN Y Z,CHEN L H,et al.Cyclic vertex-connectivity of Cartesian product graphs[J].International Journal of Parallel,Emergent and Distributed Systems,2019,1659259:10.
BOTTREAU A,METIVIER Y.Some remarks on the Kronecker product of graphs[J].Information Processing Letters,1998,68(2):55-61.
WEICHSEL P M.The Kronecker product of graphs[J].Proceedings of the American Mathematical Society,1962,13(1):47-52.
0
Views
118
下载量
0
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621