Let ΞΊ(G) be the connectivity of G. The Kronecker product G1βΓG2β of graphs G1β and G2β has vertex set V(G1βΓG2β)=V(G1β)ΓV(G2β) and edge set E(G1βΓG2β)={(u1β,v1β)(u2β,v2β):u1βu2ββE(G1β),v1βv2ββE(G2β)}. In this paper, we prove that ΞΊ(GΓK2β)=min{2ΞΊ(G),min{β£Xβ£+2β£Yβ£}}, where the second
minimum is taken over all disjoint sets X,YβV(G) satisfying
(1)Gβ(XβͺY) has a bipartite component C, and (2) G[V(C)βͺ{x}] is
also bipartite for each xβX.Comment: 6 page
Let G1β and G2β be two undirected nontrivial graphs. The Kronecker
product of G1β and G2β denoted by G1ββG2β with vertex set
V(G1β)ΓV(G2β), two vertices x1βx2β and y1βy2β are adjacent if and
only if (x1β,y1β)βE(G1β) and (x2β,y2β)βE(G2β). This paper presents a
formula for computing the diameter of G1ββG2β by means of the
diameters and primitive exponents of factor graphs.Comment: 9 pages, 18 reference
Let ΞΊ(G) be the connectivity of G and GΓH the direct product
of G and H. We prove that for any graphs G and Knβ with nβ₯3,
ΞΊ(GΓKnβ)=min{nΞΊ(G),(nβ1)Ξ΄(G)}, which was conjectured
by Guji and Vumar.Comment: 5 pages, accepted by Ars Com