Paper Info
Title
The Thickness Of The Kronecker Product Of Graphs
Abstract
The thickness of a graph G is the minimum number of planar subgraphs whose union is G. In this paper, we present sharp lower and upper bounds for the thickness of the Kronecker product G x H of two graphs G and H. We also give the exact thickness numbers for the Kronecker product graphs K-n x K-2, K-m,K-n x K-2 and K-n,K-n,K-n x K-2.
Year
DOI
Venue
2020
10.26493/1855-3974.1998.2f4
ARS MATHEMATICA CONTEMPORANEA
Keywords
DocType
Volume
Thickness, Kronecker product graph, planar decomposition
Journal
18
Issue
ISSN
Citations 
2
1855-3966
0
PageRank 
References 
Authors
0.34
6
2
Name
Order
Citations
PageRank
Xia Guo112.04
Yan Yang212122.47