The thickness of cartesian product $K_n \Box P_m$

Details The thickness of cartesian product $K_n \Box P_m$ The thickness of cartesian product $K_n \Box P_m$

2012-02-09

arxiv.org/abs/1202.1870v1

Mathematics

Combinatorics

6 pages, 5 figures

Scientific paper

The thickness $\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. It is a topological invariant of a graph, which was defined by W.T. Tutte in 1963 and also has important applications to VLSI design. But comparing with other topological invariants, e.g. genus and crossing number, results about thickness of graphs are few. The only types of graphs whose thicknesses have been obtained are complete graphs, complete bipartite graphs and hypercubes. In this paper, by operations on graphs, the thickness of the cartesian product $K_n \Box P_m$, $n,m \geq 2$ are obtained.

Affiliated with

Also associated with

No associations

Rating

The thickness of cartesian product $K_n \Box P_m$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The thickness of cartesian product $K_n \Box P_m$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The thickness of cartesian product $K_n \Box P_m$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-156278