|
This article is cited in 8 scientific papers (total in 8 papers)
Discrete mathematics and mathematical cybernetics
Perfect colorings of the prism graph
M. A. Lisitsynaa, S. V. Avgustinovichb a Budyonny Military Academy of Telecommunications, Tikhoretsky pr., 3, 194064, St. Petersburg, Russia
b Sobolev Institute of Mathematics, pr. Koptyuga, 4, 630090, Novosibirsk, Russia
Abstract:
The cartesian product of an infinite chain by an edge is termed the infinite prism graph. A complete description of perfect colorings is obtained for prism graph. Bipartition of mentioned graph was used essentially by researchers. It's easy to adapt all results to finite case — finite prism graph and Mobius ladder.
Keywords:
prism graph, Mobius ladder, perfect coloring, equitable partition, bipartite graph, induced coloring.
Received July 13, 2016, published December 8, 2016
Citation:
M. A. Lisitsyna, S. V. Avgustinovich, “Perfect colorings of the prism graph”, Sib. Èlektron. Mat. Izv., 13 (2016), 1116–1128
Linking options:
https://www.mathnet.ru/eng/semr738 https://www.mathnet.ru/eng/semr/v13/p1116
|
Statistics & downloads: |
Abstract page: | 448 | Full-text PDF : | 131 | References: | 58 |
|