64,695 research outputs found
On the super connectivity of Kronecker products of graphs
In this paper we present the super connectivity of Kronecker product of a
general graph and a complete graph.Comment: 8 page
Connectivity of Direct Products of Graphs
Let be the connectivity of and the direct product
of and . We prove that for any graphs and with ,
, which was conjectured
by Guji and Vumar.Comment: 5 pages, accepted by Ars Com
The generalized 3-edge-connectivity of lexicographic product graphs
The generalized -edge-connectivity of a graph is a
generalization of the concept of edge-connectivity. The lexicographic product
of two graphs and , denoted by , is an important graph
product. In this paper, we mainly study the generalized 3-edge-connectivity of
, and get upper and lower bounds of .
Moreover, all bounds are sharp.Comment: 14 page
On the diameter of the Kronecker product graph
Let and be two undirected nontrivial graphs. The Kronecker
product of and denoted by with vertex set
, two vertices and are adjacent if and
only if and . This paper presents a
formula for computing the diameter of by means of the
diameters and primitive exponents of factor graphs.Comment: 9 pages, 18 reference
- …