- Tytuł:
- The Thickness of Amalgamations and Cartesian Product of Graphs
- Autorzy:
-
Yang, Yan
Chen, Yichao - Powiązania:
- https://bibliotekanauki.pl/articles/31341728.pdf
- Data publikacji:
- 2017-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
thickness
amalgamation
Cartesian product
genus - Opis:
- The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study the thickness of Cartesian product of graphs, and by using operations on graphs, we derive the thickness of the Cartesian product Kn □ Pm for most values of m and n.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2017, 37, 3; 561-572
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł