𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular maps of graphs of order 4p

✍ Scribed by Jin Xin Zhou; Yan Quan Feng

Book ID
113057243
Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2011
Tongue
English
Weight
399 KB
Volume
28
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Families of Regular Graphs in Regular Ma
Families of Regular Graphs in Regular Maps
✍ Steve Wilson 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 227 KB

The question of when a given graph can be the underlying graph of a regular map has roots a hundred years old and is currently the object of several threads of research. This paper outlines this topic briefly and proves that a product of graphs which have regular embeddings also has such an embeddin

P4-decompositions of regular graphs
P4-decompositions of regular graphs
✍ Heinrich, Katherine; Liu, Jiping; Yu, Minli 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

In this article, we show that every simple r-regular graph G admits a balanced P 4 -decomposition if r ≡ 0(mod 3) and G has no cut-edge when r is odd. We also show that a connected 4-regular graph G admits a P 4 -decomposition if and only if |E(G)| ≡ 0(mod 3) by characterizing graphs of maximum degr

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

On 4-ordered 3-regular graphs
On 4-ordered 3-regular graphs
✍ Ming Tsai; Tsung-Han Tsai; Jimmy J.M. Tan; Lih-Hsing Hsu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 295 KB
Cubic s-regular graphs of order 2p3
Cubic s-regular graphs of order 2p3
✍ Yan-Quan Feng; Jin Ho Kwak; Ming-Yao Xu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract A graph is __s‐regular__ if its automorphism group acts regularly on the set of its __s__‐arcs. Malnič et al. (Discrete Math 274 (2004), 187–198) classified the connected cubic edge‐transitive, but not vertex‐transitive graphs of order 2__p__^3^ for each prime __p__. In this article, we