A Maximal Toroidal Graph which is not a Triangulation.
نویسندگان
چکیده
منابع مشابه
groups for which the noncommuting graph is a split graph
the noncommuting graph $nabla (g)$ of a group $g$ is asimple graph whose vertex set is the set of noncentral elements of$g$ and the edges of which are the ones connecting twononcommuting elements. we determine here, up to isomorphism, thestructure of any finite nonabeilan group $g$ whose noncommutinggraph is a split graph, that is, a graph whose vertex set can bepartitioned into two sets such t...
متن کاملA GRAPH WHICH RECOGNIZES IDEMPOTENTS OF A COMMUTATIVE RING
In this paper we introduce and study a graph on the set of ideals of a commutative ring $R$. The vertices of this graph are non-trivial ideals of $R$ and two distinct ideals $I$ and $J$ are adjacent if and only $IJ=Icap J$. We obtain some properties of this graph and study its relation to the structure of $R$.
متن کاملModules for which every non-cosingular submodule is a summand
A module $M$ is lifting if and only if $M$ is amply supplemented and every coclosed submodule of $M$ is a direct summand. In this paper, we are interested in a generalization of lifting modules by removing the condition"amply supplemented" and just focus on modules such that every non-cosingular submodule of them is a summand. We call these modules NS. We investigate some gen...
متن کاملA convex polyhedron which is not equifacettable
A famous theorem due to E. Steinitz states, in one of its formulations, that every planar (or, equivalently, every spherical) graph can be realized as the graph of edges and vertices of a convex polyhedron in Euclidean 3-space (see, for example, Grünbaum [1, Section 13.1] or Ziegler [3, Chapter 4]). This representation is possible in many different ways, but in all of them the circuits that bou...
متن کاملAn ACCL which is not a CRCL
It is fairly easy to show that every regular set is an almost-confluent congruential language (ACCL), and it is known [3] that every regular set is a Church-Rosser congruential language (CRCL). Whether there exists an ACCL, which is not a CRCL, seems to remain an open question. In this note we present one such ACCL.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1973
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-11476