On Eggleton and Guy Conjectured Upper Bound for the Crossing Number of the N{cube Luerbio Faria
نویسنده
چکیده
The crossing number (G) of a graph G is the smallest integer such that there is a drawing for G with (G) crossings of edges. Let Q n denote the n{dimensional
منابع مشابه
Upper bounds on the solutions to n = p+m^2
ardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{R}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملThe Splitting Number of the 4-Cube
The splitting number of a graph G consists in the smallest positive integer k 0, such that a planar graph can be obtained from G by k splitting operations, such operation replaces v by two nonadjacent vertices v1 and v2, and attaches the neighbors of v either to v1 or to v2. One of the most useful graphs in computer science is the n{cube. Dean and Richter devoted an article to proving that the ...
متن کاملOn the Independence Numbers of the Cubes of Odd Cycles
We give an upper bound on the independence number of the cube of the odd cycle C8n+5. The best known lower bound is conjectured to be the truth; we prove the conjecture in the case 8n + 5 prime and, within 2, for general n.
متن کاملAn upper bound for the crossing number of bubble-sort graph Bn
Symmetric graphs, such as the n-dimensional Boolean hypercube Qn, and the cube-connected cycles, have been widely used as processor or communication interconnection networks. For designing, analyzing and improving such networks, Akers and Krishnamurthy proposed a formal grouptheoretic model in [1]. Based on the model, the n-dimensional bubble-sort graph is proposed as one of those classes of ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997