Constructive descriptions of \(n\) -sequentially connected graphs

Shangin R. E.
Vladikavkaz Mathematical Journal 2013. Vol. 15. Issue 4.

Abstract:
The class of nonoriented \(n\)-sequentially  connected graphs is introduced and some applications are  considered. The main characteristics and properties of \(n\)-sequentially  connected chains are given. The relations of the class of $n$-sequentially connected  chains to perfect, triangulated, composite and splittable classes  of graphs are determined.

Keywords: \(n\)-sequentially connected graph, treewidth of a graph, triangulated graph, dynamic programming, Weber problem, quadratic assignment problem

The sole copyright holder of the published work is the Founder of the Vladikavkaz Mathematical Journal. The terms of use of this work are governed by an open license (Creative Commons Attribution-NonCommercial 4.0 International). The use of metadata of the scientific article, including the title, abstract, author information, references, identifiers, and other bibliographic description elements for subsequent unrestricted use, is carried out under the terms of the CC BY or CC0 open licenses.