✦ LIBER ✦

Large families of mutually embeddable vertex-transitive graphs

✍ Scribed by Anthony Bonato; Claude Tardif

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 87 KB
Volume: 43
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10105

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

For each infinite cardinal κ, we give examples of 2^κ^ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003

📜 SIMILAR VOLUMES

Large Cayley graphs and vertex-transitiv

Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter

✍ Heather Macbeth; Jana Šiagiová; Jozef Širáň; Tomáš Vetrík 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract For any __d__⩾5 and __k__⩾3 we construct a family of Cayley graphs of degree __d__, diameter __k__, and order at least __k__((__d__−3)/3)^__k__^. By comparison with other available results in this area we show that our family gives the largest currently known Cayley graphs for a wide ra

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

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

Vertex Ramsey Properties of Families of

Vertex Ramsey Properties of Families of Graphs

✍ Tomasz Łuczak; Andrzej Ruciński; Sebastian Urbański 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 118 KB

For graphs F, G 1 , ..., G r , we write F Q (G 1 , ..., G r ) if for every coloring of the vertices of F with r colors there exists i, i=1, 2, ..., r, such that a copy of G i is colored with the ith color. For two families of graphs G 1 , ..., G r and H 1 , ..., H s , by .., H s ) for every graph F

On Hamiltonicity of Vertex-Transitive Gr

On Hamiltonicity of Vertex-Transitive Graphs and Digraphs of Orderp4

✍ Yu Qing Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 352 KB

The main result of this paper is that vertex-transitive graphs and digraphs of order p 4 are Hamiltonian, where p is a prime number. 1998 Academic Press 1. INTRODUCTION Witte [7] proved that Cayley digraphs of finite p-groups are Hamiltonian. In [2], Marus$ ic$ showed that all vertex-transitive digr