|
This article is cited in 4 scientific papers (total in 4 papers)
Computer science
The ordered set of connected parts of a polygonal graph
V. N. Salii Saratov State University, Russia, 410012, Saratov, Astrahanskaya st., 83
Abstract:
Under a polygonal graph is meant an oriented graph obtained from a cycle by some orientation of its edges. The set of all abstract (i.e. pairwise non-isomorphic) connected parts of a polygonal graph is ordered by graph embedding. Polygonal graphs are characterized for which this ordered set is a lattice.
Key words:
polygonal graph, linear graph, binary vector, duality, ordered set, lattice.
Citation:
V. N. Salii, “The ordered set of connected parts of a polygonal graph”, Izv. Saratov Univ. Math. Mech. Inform., 13:2(2) (2013), 44–51
Linking options:
https://www.mathnet.ru/eng/isu412 https://www.mathnet.ru/eng/isu/v13/i4/p44
|
Statistics & downloads: |
Abstract page: | 242 | Full-text PDF : | 83 | References: | 58 |
|