The thickness of amalgamations of graphs

Details The thickness of amalgamations of graphs The thickness of amalgamations of graphs

2012-01-31

arxiv.org/abs/1201.6483v1

Mathematics

Combinatorics

5 pages

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. As a topological invariant of a graph, it is a measurement of the closeness to planarity of a graph, and it also has important applications to VLSI design. In this paper, the thickness of graphs that are obtained by vertex-amalgamation and bar-amalgamation of any two graphs whose thicknesses are known are obtained, respectively. And the lower and upper bounds for the thickness of graphs that are obtained by edge-amalgamation and 2-vertex-amalgamation of any two graphs whose thicknesses are known are also derived, respectively.

Affiliated with

Also associated with

No associations

Rating

The thickness of amalgamations of graphs 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 amalgamations of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The thickness of amalgamations of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56626