Discrete Applied Mathematics - Special double volume: interconnection networks
Proceedings of the first Malta conference on Graphs and combinatorics
Imbeddings of the tensor product of graphs where the second factor is a complete graph
Discrete Mathematics - Special issue on Graph theory
Representations of Graphs by Means of Products and Their Complexity
Proceedings on Mathematical Foundations of Computer Science
On Hamilton cycle decompositions of the tensor product of complete graphs
Discrete Mathematics
SIAM Journal on Discrete Mathematics
Minimum cycle bases of direct products of complete graphs
Information Processing Letters
Independent sets in tensor graph powers
Journal of Graph Theory
A finite automata approach to modeling the cross product of interconnection networks
Mathematical and Computer Modelling: An International Journal
Super connectivity of Kronecker products of graphs
Information Processing Letters
Note: Wiener and vertex PI indices of Kronecker products of graphs
Discrete Applied Mathematics
On edge connectivity of direct products of graphs
Information Processing Letters
On some topological indices of the tensor products of graphs
Discrete Applied Mathematics
On the super connectivity of Kronecker products of graphs
Information Processing Letters
Note: Connectivity of Kronecker products with complete multipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.89 |
Let G"1 and G"2 be two graphs. The Kronecker product G"1xG"2 of G"1 and G"2 has vertex set V(G"1xG"2)=V(G"1)xV(G"2) and edge set E(G"1xG"2)={(u"1,v"1)(u"2,v"2):u"1u"2@?E(G"1) and v"1v"2@?E(G"2)}. In this paper, we determine some vertex vulnerability parameters of the Kronecker product of complete graphs K"mxK"n for n=m=2 and n=3.