Crossing graphs of fiber-complemented graphs
نویسندگان
چکیده
منابع مشابه
On zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملon zero-divisor graphs of quotient rings and complemented zero-divisor graphs
for an arbitrary ring $r$, the zero-divisor graph of $r$, denoted by $gamma (r)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $r$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. it is well-known that for any commutative ring $r$, $gamma (r) cong gamma (t(r))$ where $t(r)$ is the (total) quotient ring of $r$. in this...
متن کاملCrossing Number Graphs
In 1940, the Hungarian mathematician Paul Turán was sent to a forced labor camp by the Nazis. Though every part of his life was brutally controlled, he still managed to do serious mathematics under the most extreme conditions. While forced to collect wire from former neighborhoods, he would be thinking about mathematics. When he found scraps of paper, he wrote down his theorems and conjectures....
متن کاملOn Fan-Crossing Graphs
A fan is a set of edges with a single common endpoint. A graph is fan-crossing if it admits a drawing in the plane so that each edge is crossed by edges of a fan. It is fan-planar if, in addition, the common endpoint is on the same side of the crossed edge. A graph is adjacencycrossing if it admits a drawing so that crossing edges are adjacent. Then it excludes independent crossings which are c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.04.005