𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A construction of thickness-minimal graphs

✍ Scribed by Jozef Širáň; Peter Horák

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
384 KB
Volume
64
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The thickness of a graph G is the minimum number of planar subgraphs whose union is G. A t-minimal graph is a graph of thickness t which contains no proper subgraph of thickness t. For each t ~> 2 we present an explicit construction of an infinite number of t-minimal graphs with connectivity 2, edge connectivity t, and minimum valency t.

📜 SIMILAR VOLUMES

Minimal graphs of a torus, a projective
Minimal graphs of a torus, a projective plane and spheres and some properties of minimal graphs of homotopy classes
✍ Alexander V. Ivashchenko; Yeong-Nan Yeh 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 397 KB

## Contractible transformations of graphs consist of contractible gluing and deleting of vertices and edges of graphs. They partition all graphs into the family of homotopy classes. Contractible transformations do not change the Euler characteristic and the homology groups of graphs. In this paper

The book thickness of a graph
The book thickness of a graph
✍ Frank Bernhart; Paul C Kainen 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 619 KB
Minimality considerations for graph ener
Minimality considerations for graph energy over a class of graphs
✍ Dongdong Wang; Hongbo Hua 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Let G be a graph on n vertices, and let CHP(G; λ) be the characteristic polynomial of its adjacency matrix A(G). All n roots of CHP(G; λ), denoted by λ i (i = 1, 2, . . . n), are called to be its eigenvalues. The energy E(G) of a graph G, is the sum of absolute values of all eigenvalues, namely, E(G