| Title: | Upper embeddability of graphs and products of transpositions associated with edges |
|---|
| Authors: | ID Tsujie, Shuhei (Author)
ID Uchiumi, Ryo (Author) |
|---|
| Files: |  AMC_Tsujie,Uchiumi_2025.pdf (324,31 KB)
MD5: 597BFEAE8C58EA39B93A3664DB391C14
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. Dénes proved that the permutation is a full cyclic permutation for any linear order if and only if the graph is a tree.
In this article, we characterize graphs having a linear order such that the associated permutation is a full cyclic permutation in terms of graph embeddings. Moreover, we give a counter example for Eden's question about an edge ordering whose associated permutation is the identity. |
|---|
| Keywords: | full cyclic permutation ordering, upper-embeddable graph, 2-cell embedding, rotation system |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 13.03.2025 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | 10 str. |
|---|
| Numbering: | Vol. 25, no. 2, [article no.] P2.05 |
|---|
| PID: | 20.500.12556/RUP-21990  |
|---|
| UDC: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | https://doi.org/10.26493/1855-3974.3023.c45 |
|---|
| Publication date in RUP: | 21.10.2025 |
|---|
| Views: | 307 |
|---|
| Downloads: | 1 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
