Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs

Sergey Kurapov; Maxim Davidovsky

Home/Archive/arXiv

arXiv · 2407.12045

Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs

Sergey Kurapov·Maxim Davidovsky

View original source ↗Read source document ↗Export metadata ↓

Abstract

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a graph or simply a graph group. The basis for constructing a group of graph automorphisms is the concept of orbit. The construction of an orbit is closely related to the quantitative assessment of a vertex or edge of a graph, called weight. To determine the weight of an element, graph invariants built on the spectrum of edge cuts and the spectrum of edge cycles are used. The weight of the graph elements allows identifying generating cycles and forming orbits. Examples are given of constructing a group of automorphisms for some types of graphs.

Explore related subjects

math.HO cs.DM math.CO math.GR

Keep this discovery

BibTeX RIS

Sergey Kurapov, Maxim Davidovsky. 2024-07-02. Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs. https://arxiv.org/abs/2407.12045

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO↗

arXiv2026

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO↗

arXiv2026

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO↗