Super connectivity of Kronecker products of graphs

Authors:
Litao Guo;Chengfu Qin;Xiaofeng Guo
Affiliations:
School of Mathematical Sciences, Xiamen University, Xiamen, Fujian 361005, China;School of Mathematical Sciences, Xiamen University, Xiamen, Fujian 361005, China and School of Mathematics Science, Guangxi Teachers Education University, 530001, Nanning, PR China;School of Mathematical Sciences, Xiamen University, Xiamen, Fujian 361005, China
Venue:
Information Processing Letters
Year:
2010

Citing 7
Cited 3

Some remarks on the Kronecker product of graphs

Information Processing Letters
On connectivity of the Cartesian product of two graphs

Applied Mathematics and Computation
Hypercubes As Direct Products

SIAM Journal on Discrete Mathematics
Vertex vulnerability parameters of Kronecker products of complete graphs

Information Processing Letters
Independent sets in tensor graph powers

Journal of Graph Theory
Super-connected and super-arc-connected Cartesian product of digraphs

Information Processing Letters
A finite automata approach to modeling the cross product of interconnection networks

Mathematical and Computer Modelling: An International Journal

The super connectivity of exchanged hypercubes

Information Processing Letters
On the super connectivity of Kronecker products of graphs

Information Processing Letters
Note: Connectivity of Kronecker products with complete multipartite graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

Let G"1 and G"2 be two connected graphs. The Kronecker product G"1xG"2 has vertex set V(G"1xG"2)=V(G"1)xV(G"2) and the edge set E(G"1xG"2)={(u"1,v"1)(u"2,v"2):u"1u"2@?E(G"1),v"1v"2@?E(G"2)}. In this paper, we show that if G is a bipartite graph with @k(G)=@d(G), then GxK"n(n=3) is super-@k.