@article{WU2022, 
author = {Liyun WU and Yingzhi TIAN},
title = {Super Connected Kronecker Products of Paths, Cycles and Cycles},
year = {2022},
journal = {Journal of Xinjiang University(Natural Science Edition in Chinese and English)},
volume = {39},
number = {2},
pages = {176-181},
keywords = {Kronecker product, connectivity, maximal connectedness, super connectedness},
url = {https://www.sciopen.com/article/10.13568/j.cnki.651094.651316.2021.02.17.0001},
doi = {10.13568/j.cnki.651094.651316.2021.02.17.0001},
abstract = {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): u1u2 ∈ E(G1),v1v2 ∈ 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.}
}