|
Lattice complete graphs
Yu. E. Bessonova, A. A. Dobryninb a All-Russian Institute for Scientific and Technical Information,
20 Usievich St., 125190 Moscow, Russia
b Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
Abstract:
We study the properties of graphs that can be placed in a rectangular lattice so that all vertices located in the same (horizontal or vertical) row be adjacent. Some criterion is formulated for an arbitrary graph to be in the specified class. Illustr. 4, bibliogr. 23.
Keywords:
graph, rectangular lattice, clique.
Received: 20.06.2017 Revised: 17.07.2017
Citation:
Yu. E. Bessonov, A. A. Dobrynin, “Lattice complete graphs”, Diskretn. Anal. Issled. Oper., 24:4 (2017), 22–33; J. Appl. Industr. Math., 11:4 (2017), 481–485
Linking options:
https://www.mathnet.ru/eng/da879 https://www.mathnet.ru/eng/da/v24/i4/p22
|
| Statistics & downloads: |
| Abstract page: | 247 | | Full-text PDF : | 103 | | References: | 79 | | First page: | 11 |
|