✦ LIBER ✦

The maximum genus of vertex-transitive graphs

✍ Scribed by Martin Škoviera; Roman Nedela

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 911 KB
Volume: 78
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90175-1

No coin nor oath required. For personal study only.

✦ Synopsis

The maximum genus of all vertex-transitive graphs is computed. It is proved that a k-valent vertex-transitive graph of girth g is upper-embeddable whenever k 3 4 or g 2 4.

Non-upper-embeddable vertex-transitive graphs are characterized. A particular attention is paid to Cayley graphs. Groups for which there exists a non-upper-embeddable Cayley graph are determined+

📜 SIMILAR VOLUMES

Vertex-transitive graphs: Symmetric grap

Vertex-transitive graphs: Symmetric graphs of prime valency

✍ Peter Lorimer 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 642 KB

Let G be a group acting symmetrically on a graph 2, let G, be a subgroup of G minimal among those that act symmetrically on 8, and let G2 be a subgroup of G, maximal among those normal subgroups of GI which contain no member except 1 which fixes a vertex of Z. The most precise result of this paper i

Cubic vertex-transitive graphs of order

Cubic vertex-transitive graphs of order 2pq

✍ Jin-Xin Zhou; Yan-Quan Feng 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

A graph is vertex-transitive or symmetric if its automorphism group acts transitively on vertices or ordered adjacent pairs of vertices of the graph, respectively. Let G be a finite group and S a subset of G such that 1 / ∈ S and S = {s -1 | s ∈ S}. The Cayley graph Cay(G, S) on G with respect to S

Tetravalent vertex-transitive graphs of

Tetravalent vertex-transitive graphs of order 4p

✍ Jin-Xin Zhou 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

A graph is __vertex‐transitive__ if its automorphism group acts transitively on vertices of the graph. A vertex‐transitive graph is a __Cayley graph__ if its automorphism group contains a subgroup acting regularly on its vertices. In this article, the tetravalent vertex‐transitive non‐Cayley graphs

Determining the hamilton-connectedness o

Determining the hamilton-connectedness of certain vertex-transitive graphs

✍ Ming Jiang; Frank Ruskey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Faber and Moore have proposed a class of vertex-transitive digraphs as a model of directed inconnection networks. These networks have attractive degree versus diameter properties. We show that these digraphs are Hamiltonian and provide necessary and sufficient conditions for the existence of a Hamil

The Relative Maximum Genus of a Graph

✍ C.P. Bonnington 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 422 KB

Characterization of graphs which admit v

Characterization of graphs which admit vertex-transitive embeddings

✍ Jozef Širáň; Thomas W. Tucker 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB