Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917724553216000 |
|---|---|
| author | Kurapov, Sergey Davidovsky, Maxim |
| author_facet | Kurapov, Sergey Davidovsky, Maxim |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_12045 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs Kurapov, Sergey Davidovsky, Maxim History and Overview Discrete Mathematics Combinatorics Group Theory 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. |
| title | Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs |
| topic | History and Overview Discrete Mathematics Combinatorics Group Theory |
| url | https://arxiv.org/abs/2407.12045 |