Однородные натуральные арифметические графы с нечетным числом вершин
A way of enumeration of regular graphs for natural arithmetical graphs was found. A definition of graphs decomposition of generatrixes was introduced. It is proved some statements about its properties. This gives a possibility to determine uniquely the structure of regular graphs.
Saved in:
| Date: | 2006 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Russian |
| Published: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2006
|
| Series: | Теорія оптимальних рішень |
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/84953 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Однородные натуральные арифметические графы с нечетным числом вершин / И.Э. Шулинок, В.Ю. Каюров // Теорія оптимальних рішень: Зб. наук. пр. — 2006. — № 5. — С. 48-54. — Бібліогр.: 7 назв. — рос. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Summary: | A way of enumeration of regular graphs for natural arithmetical graphs was found. A definition of graphs decomposition of generatrixes was introduced. It is proved some statements about its properties. This gives a possibility to determine uniquely the structure of regular graphs. |
|---|