𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex-transitive triangulations of compact orientable 2-manifolds

✍ Scribed by David B Surowski


Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
296 KB
Volume
39
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On Face-Vectors and Vertex-Vectors of Ce
✍ E. Jucovič πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 502 KB

Dedicnted to the Memory of M y Parents (Eingegangen am 3. 1.1975) BILINSKI [2].) Obviously and from EULER'S formula (f(M) +v(lM) -h ( M ) ) = 2 (1 -9) (where f(iV) or h ( M ) or v ( M ) denotes the number of 2-, or 1-or O-cells of M , respectively) follow the equalities C i . p i ( M ) = C,i.v,(N)=Z

Cubic vertex-transitive graphs of order
✍ 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

A class of non-Cayley vertex- transitive
✍ Dragan MaruΕ‘ič; Raffaele Scapellato πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 851 KB

MaruSiE, D. and R. Scapellato, A class of non-Cayley vertex-transitive graphs associated with PSL(2, p), Discrete Mathematics 109 (1992) 161-170. A construction for a class of non-Cayley vertex-transitive graphs associated with PSL(2,p) acting by right multiplication on the right cosets of a dihedr

The Crossing Number of a Graph on a Comp
✍ F. Shahrokhi; O. SΓ½kora; L.A. SzΓ©kely; I. VrΕ₯o πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 478 KB

We introduce a general framework to estimate the crossing number of a graph on a compact 2-manifold in terms of the crossing number of the complete graph of the same size on the same manifold. The bounds are tight within a constant multiplicative factor for many graphs, including hypercubes, some co