| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Edge-transitive lexicographic and cartesian products
Authors:ID Imrich, Wilfried (Author)
ID Iranmanesh, Ali (Author)
ID Klavžar, Sandi (Author)
ID Soltani, Abolghasem (Author)
Files:.pdf Discussiones_Mathematicae_Graph_Theory_2016_Imrich_et_al._Edge-transitive_lexicographic_and_Cartesian_products.pdf (150,33 KB)
MD5: 69CDEAAAF474E8D160D243D46BBD6A32
 
URL http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1892
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product ▫$G \circ 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 \circ H$▫ is non-trivial and complete, then ▫$G \circ 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 (Appl. Math. Lett. 24 (2011) 1924--1926). 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.
Keywords:edge-transitive graph, vertex-transitive graph, lexicographic product of graphs, Cartesian product of graphs
Publication status:Published
Publication version:Version of Record
Submitted for review:16.04.2015
Article acceptance date:29.12.2015
Publication date:29.12.2015
Publisher:University of Zielona Góra
Year of publishing:2016
Number of pages:Str. 857-865
Numbering:Letn. 36, št. 4
PID:20.500.12556/DKUM-65337 New window
ISSN:1234-3099
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:17777241 New window
NUK URN:URN:SI:UM:DK:HWK1G8VH
Publication date in DKUM:31.03.2017
Views:1202
Downloads:464
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discussiones mathematicae. Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:29.12.2015

Secondary language

Language:Slovenian
Title:Povezavno-tranzitivni leksikografski in kartezični produkti
Abstract:Karakterizirani so povezani, povezavno-tranzitivni leksikografski in kartezični produkti. Za leksikografski produkt ▫$G \circ H$▫, kjer je $G$ povezan in ni poln, dokažemo, da je povezavno-tranzitiven natanko tedaj, ko je ▫$G$▫ povezavno-tranzitiven in je ▫$H$▫ brez povezav.Če je prvi faktor produkta ▫$G \circ H$▫ netrivialen in poln, potem je ▫$G\circ H$▫ povezavno-tranzitiven natanko tedaj, ko je ▫$H$▫ leksikografski produkt polnega grafa z grafom brez povezav. S tem je popravljena napaka avtorjev Li, Wang, Xu in Zhao (Appl. Math. Lett. 24 (2011) 1924--1926). Za kartezični produkt je dokazano, da je kartezični produkt vsaj dveh netrivialnih faktorjev povezavno-tranzitiven natanko tedaj, ko je kartezična potenca povezanega, povezavno- in vozliščno-tranzitivnega grafa.
Keywords:povezavno-tranzitivni graf, vozliščno-tranzitivni graf, leksikografski produkt grafov, kartezični produkt grafov


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica