8,418 research outputs found
Extremal Infinite Graph Theory
We survey various aspects of infinite extremal graph theory and prove several
new results. The lead role play the parameters connectivity and degree. This
includes the end degree. Many open problems are suggested.Comment: 41 pages, 16 figure
Intersection Graph of a Module
Let be a left -module where is a (not necessarily commutative)
ring with unit. The intersection graph \cG(V) of proper -submodules of
is an undirected graph without loops and multiple edges defined as follows: the
vertex set is the set of all proper -submodules of and there is an edge
between two distinct vertices and if and only if We
study these graphs to relate the combinatorial properties of \cG(V) to the
algebraic properties of the -module We study connectedness, domination,
finiteness, coloring, and planarity for \cG (V). For instance, we find the
domination number of \cG (V). We also find the chromatic number of \cG(V)
in some cases. Furthermore, we study cycles in \cG(V), and complete subgraphs
in \cG (V) determining the structure of for which \cG(V) is planar
- …