𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Semisymmetric graphs from polytopes

✍ Scribed by Barry Monson; Tomaž Pisanski; Egon Schulte; Asia Ivić Weiss

Book ID
108167194
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
338 KB
Volume
114
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semisymmetric graphs of order
Semisymmetric graphs of order
✍ Wang, Li; Du, Shaofei 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 415 KB
Normal Polytopes Arising from Finite Gra
Normal Polytopes Arising from Finite Graphs
✍ Hidefumi Ohsugi; Takayuki Hibi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Ä 4 Let G be a finite connected graph on the vertex set 1, . . . , d allowing loops and w x having no multiple edge. Let K t , . . . , t denote the polynomial ring in d w x w x indeterminates over a field K and let K G be the subalgebra of K t , . . . , t Ä 4 generated by all quadratic monomials t

Semisymmetric cubic graphs of order 16p2
Semisymmetric cubic graphs of order 16p2
✍ Mehdi Alaeiyan; Hamid A. Tavallaee; B. N. Onagh 📂 Article 📅 2010 🏛 Indian Academy of Sciences 🌐 English ⚖ 163 KB
An infinite family of biprimitive semisy
An infinite family of biprimitive semisymmetric graphs
✍ Du, Shao-Fei; Maru??i??, Dragan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB 👁 1 views

A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these two parts. A semisymmetric graph is called biprimiti