- Tytuł:
- Edge-Transitive Lexicographic and Cartesian Products
- Autorzy:
-
Imrich, Wilfried
Iranmanesh, Ali
Klavžar, Sandi
Soltani, Abolghasem - Powiązania:
- https://bibliotekanauki.pl/articles/31340755.pdf
- Data publikacji:
- 2016-11-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
edge-transitive graph
vertex-transitive graph
lexicographic product of graphs
Cartesian product of graphs - Opis:
- In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge-transitive and H is edgeless. If the first factor of G ∘ H is non-trivial and complete, then G ∘ H is edge-transitive if and only if H is the lexicographic product of a complete graph by an edgeless graph. This fixes an error of Li, Wang, Xu, and Zhao [11]. For the Cartesian product it is shown that every connected Cartesian product of at least two non-trivial factors is edge-transitive if and only if it is the Cartesian power of a connected, edge- and vertex-transitive graph.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2016, 36, 4; 857-865
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł