5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one
نویسندگان
چکیده
منابع مشابه
Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters
We consider the class of pentagonal 3-polytopal graphs all of whose edges are incident either with two 3-valent vertices or with a 3-valent vertex and a q-valent vertex. For most values of q, (i) we find a small non-hamiltonian graph in the class and (ii) we show that the shortness exponent of the class and the shortness coefficient of a special subclass are less than one. For q--4, we find a p...
متن کاملMaximal Nontraceable Graphs with Toughness less than One
A graph G is maximal nontraceable (MNT) if G does not have a hamiltonian path but, for every e ∈ E (
متن کاملGraphs with fourth Laplacian eigenvalue less than two
In this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than two are determined, which are used to characterize all connected graphs with exactly three Laplacian eigenvalues no less than two. Moreover, we determine bipartite graphs such that the adjacency matrices of their line graphs have exactly three nonnegative eigenvalues. © 2003 Elsevier Ltd. All rights reser...
متن کامل5-Regular Graphs are 3-Colorable with Positive Probability
We show that uniformly random 5-regular graphs of n vertices are 3-colorable with probability that is positive independently of n.
متن کاملDrawing polytopal graphs with polymake
This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces and tropical polytopes. In all our cases we arrive at specific, geometrically motivated, graph drawing problems. The methods displayed are implemented in the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00183-w