Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Daniel Pellicer Mathematics , 2011, Abstract: Among all equivelar vertex-transitive maps on a given closed surface S, the automorphism groups of maps with Schl\"afli types {3, 7} and {7, 3} allow the highest possible order. We describe a procedure to transform all such maps into 1- or 2-orbit maps, whose symmetry type has been previously studied. In so doing we provide a procedure to determine all vertex-transitive maps with Schl\"afli type {3, 7} which are neither regular or chiral. We determine all such maps on surfaces with Euler characteristic -1 \geq \c{hi} \geq -40.
 Mathematics , 2013, Abstract: Semi-Equivelar maps are generalizations of Archimedean solids to the surfaces other than 2-sphere. In earlier work a complete classification of semi-equivelar map of type $(3^5, 4)$ on the surface of Euler characteristic -1 was given. In the meantime Karabas an Nedela classified vertex transitive semi-equivelar maps on the double torus. In this article we study the types of semi-equivelar maps on double torus that are also available on the surface of Euler characteristic -1. We classify them and show that none of them are vertex transitive.
 Mathematics , 2011, Abstract: Semi-Equivelar maps are generalizations of Archimedean Solids (as are equivelar maps of the Platonic solids) to the surfaces other than $2-$Sphere. We classify some semi equivelar maps on surface of Euler characteristic -1 and show that none of these are vertex transitive. We establish existence of 12-covered triangulations for this surface. We further construct double cover of these maps to show existence of semi-equivelar maps on the surface of double torus. We also construct several semi-equivelar maps on the surfaces of Euler characteristics -8 and -10 and on non-orientable surface of Euler characteristics -2.
 David Roberson Mathematics , 2013, Abstract: A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that for vertex transitive graphs, the size of the core must divide the size of the graph. This motivates the following question: when can the vertex set of a vertex transitive graph be partitioned into sets each of which induce a copy of its core? We show that normal Cayley graphs and vertex transitive graphs with cores half their size always admit such partitions. We also show that the vertex sets of vertex transitive graphs with cores less than half their size do not, in general, have such partitions.
 Jennifer Henry Mathematics , 2001, Abstract: We develop a method to find a set of diminimal polyhedral maps on the torus from which all other polyhedral maps on the torus may be generated by face splitting and vertex splitting. We employ this method, though not to its completion, to find 53 diminimal polyhedral maps on the Torus.
 Dmytro Chebotarov Mathematics , 2010, Abstract: We present a classification of transitive vertex algebroids on a smooth variety X carried out in the spirit of Bressler's classification of Courant algebroids. In particular, we compute the class of the stack of transitive vertex algebroids. We define deformations of sheaves of twisted chiral differential operators introduced in \cite{AChM} and use the classification result to describe and classify such deformations. As a particular case, we obtain a localization of Wakimoto modules at non-critical level on flag manifolds.
 Peter G. Doyle Mathematics , 2007, Abstract: I describe a 27-vertex graph that is vertex-transitive and edge-transitive but not 1-transitive. Thus while all vertices and edges of this graph are similar, there are no edge-reversing automorphisms.
 Computer Science , 2014, DOI: 10.1016/j.ejc.2014.09.007 Abstract: A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and only if it is well-covered, co-well-covered, and the product of its clique and stability numbers equals its order. A graph is irreducible if no two distinct vertices have the same neighborhood. We classify irreducible well-covered CIS graphs with clique number at most 3 and vertex-transitive CIS graphs of valency at most 7, which include an infinite family. We also exhibit an infinite family of vertex-transitive CIS graphs which are not Cayley.
 Mathematics , 2011, Abstract: Let $k$ be an integer. We prove a rough structure theorem for separations of order at most $k$ in finite and infinite vertex transitive graphs. Let $G = (V,E)$ be a vertex transitive graph, let $A \subseteq V$ be a finite vertex-set with $|A| \le |V|/2$ and $|\{v \in V \setminus A : {$u \sim v$for some$u \in A$} \}|\le k$. We show that whenever the diameter of $G$ is at least $31(k+1)^2$, either $|A| \le 2k^3+k^2$, or $G$ has a ring-like structure (with bounded parameters), and $A$ is efficiently contained in an interval. This theorem may be viewed as a rough characterization, generalizing an earlier result of Tindell, and has applications to the study of product sets and expansion in groups.
 Mathematics , 2012, Abstract: Let $(X_n)$ be an unbounded sequence of finite, connected, vertex transitive graphs such that $|X_n | = o(diam(X_n)^q)$ for some $q>0$. We show that up to taking a subsequence, and after rescaling by the diameter, the sequence $(X_n)$ converges in the Gromov Hausdorff distance to a torus of dimension $1$ sufficiently small, we prove, this time by elementary means, that $(X_n)$ converges to a circle.
 Page 1 /100 Display every page 5 10 20 Item