On perfect colorings of infinite multipath graphs Full article
| Journal |
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304 |
||||||
|---|---|---|---|---|---|---|---|
| Output data | Year: 2020, Volume: 17, Pages: 2084-2095 Pages count : 12 DOI: 10.33048/semi.2020.17.139 | ||||||
| Tags | perfect coloring, equitable partition, equivalent colors, infinite multipath graph | ||||||
| Authors |
|
||||||
| Affiliations |
|
Abstract:
A coloring of vertices of a given graph is called perfect if the color structure of each sphere of radius 1 in the graph depends only on the color of the sphere center. Let n be a positive integer. We consider a lexicographic product of the infinite path graph and a graph G that can be either the complete or empty graph on n vertices. We give a complete description of perfect colorings with an arbitrary number of colors of such graph products
Cite:
Lisitsyna M.A.
, Avgustinovich S.V.
, Parshina O.G.
On perfect colorings of infinite multipath graphs
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2020. V.17. P.2084-2095. DOI: 10.33048/semi.2020.17.139 WOS Scopus РИНЦ OpenAlex
On perfect colorings of infinite multipath graphs
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2020. V.17. P.2084-2095. DOI: 10.33048/semi.2020.17.139 WOS Scopus РИНЦ OpenAlex
Dates:
| Submitted: | Jun 11, 2020 |
| Published online: | Dec 18, 2020 |
Identifiers:
| Web of science: | WOS:000615617100001 |
| Scopus: | 2-s2.0-85099189888 |
| Elibrary: | 44726650 |
| OpenAlex: | W3113671413 |