On edge connectivity of direct products of graphsCao, Xiang-Lan (Avtor) Brglez, Špela (Avtor) Špacapan, Simon (Avtor) Vumar, Elkin (Avtor) mathematicsgraph theorycombinatorial problemsconnectivitydirect productgraph productseparating setLet ▫$lambda(G)$▫ be the edge connectivity of ▫$G$▫. The direct product of graphs ▫$G$▫ and ▫$H$▫ is the graph with vertex set ▫$V(G times H) = V(G) times V(H)$▫, where two vertices ▫$(u_1,v_1)$▫ and ▫$(u_2,v_2)$▫ are adjacent in ▫$G times H$▫ if ▫$u_1u_2 in E(G)$▫ and ▫$v_1v_2 in E(H)$▫. We prove that ▫$lambda(G times K_n) = min{n(n-1)lambda(G), (n-1)delta(G)}$▫ for every nontrivial graph ▫$G$▫ and ▫$n geqslant 3$▫. We also prove that for almost every pair of graphs ▫$G$▫ and ▫$H$▫ with ▫$n$▫ vertices and edge probability ▫$p$▫, ▫$G times H$▫ is ▫$k$▫-connected, where ▫$k=O((n/log n)^2)$▫.20112012-06-01 08:54:27Neznano26959UDK: 519.17COBISS_ID: 16006745ISSN pri članku: 0020-0190NUK URN: URN:SI:UM:DK:HIJLUXNWsl