Вход на сайт

Просмотр новости

Найдите то, что Вас интересует

The Möbius–Kantor graph is a faithful unit-distance graph

Дата публикации: 12-03-2026 00:00:00

In this paper, it has been shown that the generalized Petersen graph GP(8, 3), also known as the Möbius–Kantor graph, admits a faithful unit-distance representation in the plane.

Основное содержимое страницы с новостью.

Authors DOI: https://doi.org/10.26493/2590-9770.1914.42a Keywords: Polycirculant, faithful unit-distance graph, Möbius–Kantor graph, generalized Petersen graph Abstract

In this paper, it has been shown that the generalized Petersen graph GP(8, 3), also known as the Möbius–Kantor graph, admits a faithful unit-distance representation in the plane.

Схожие новости

#Наименование новостиТональностьИнформативностьДата публикации
1Paint cost spectrum of perfect k-ary trees05.1528-01-2026
2A note on Cayley nut graphs whose degree is divisible by four011.6203-02-2026
3Scramble number and tree-cut decompositions09.1821-04-2026
4Edge criticality in signed graphs admitting a Roman dominating function08.1126-02-2026
5The fibre--sum of graphs03.2810-08-2026
6Rank-metric codes over arbitrary fields: Bounds and constructions08.410-08-2026
7Switching graphs and Hadamard matrices08.5621-05-2026
8Perfect Hermitian rank-metric codes09.1801-07-2026
9Stability of the Kerr–Newman black hole under small perturbations0712-02-2026
10Topological constrains for the solutions of EFE0513-03-2026

Классификация: . Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 13.24. Источник: adam-journal.eu.