ترغب بنشر مسار تعليمي؟ اضغط هنا

VPG and EPG bend-numbers of Halin Graphs

206   0   0.0 ( 0 )
 نشر من قبل Abhiruk Lahiri
 تاريخ النشر 2015
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

A piecewise linear curve in the plane made up of $k+1$ line segments, each of which is either horizontal or vertical, with consecutive segments being of different orientation is called a $k$-bend path. Given a graph $G$, a collection of $k$-bend paths in which each path corresponds to a vertex in $G$ and two paths have a common point if and only if the vertices corresponding to them are adjacent in $G$ is called a $B_k$-VPG representation of $G$. Similarly, a collection of $k$-bend paths each of which corresponds to a vertex in $G$ is called an $B_k$-EPG representation of $G$ if any two paths have a line segment of non-zero length in common if and only if their corresponding vertices are adjacent in $G$. The VPG bend-number $b_v(G)$ of a graph $G$ is the minimum $k$ such that $G$ has a $B_k$-VPG representation. Similarly, the EPG bend-number $b_e(G)$ of a graph $G$ is the minimum $k$ such that $G$ has a $B_k$-EPG representation. Halin graphs are the graphs formed by taking a tree with no degree $2$ vertex and then connecting its leaves to form a cycle in such a way that the graph has a planar embedding. We prove that if $G$ is a Halin graph then $b_v(G) leq 1$ and $b_e(G) leq 2$. These bounds are tight. In fact, we prove the stronger result that if $G$ is a planar graph formed by connecting the leaves of any tree to form a simple cycle, then it has a VPG-representation using only one type of 1-bend paths and an EPG-representation using only one type of 2-bend paths.



قيم البحث

اقرأ أيضاً

In this paper, we investigate the ratio of the numbers of odd and even cycles in outerplanar graphs. We verify that the ratio generally diverges to infinity as the order of a graph diverges to infinity. We also give sharp estimations of the ratio for several classes of outerplanar graphs, and obtain a constant upper bound of the ratio for some of them. Furthermore, we consider similar problems in graphs with some pairs of forbidden subgraphs/minors, and propose a challenging problem concerning claw-free graphs.
We study the Optimal Linear Arrangement (OLA) problem of Halin graphs, one of the simplest classes of non-outerplanar graphs. We present several properties of OLA of general Halin graphs. We prove a lower bound on the cost of OLA of any Halin graph, and define classes of Halin graphs for which the cost of OLA matches this lower bound. We show for these classes of Halin graphs, OLA can be computed in O(n log n), where n is the number of vertices.
The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $S$ such that only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing set of a group $Gamma$ is the set of all fixing numbers of finite graphs with a utomorphism group $Gamma$. Several authors have studied the distinguishing number of a graph, the smallest number of labels needed to label $G$ so that the automorphism group of the labeled graph is trivial. The fixing number can be thought of as a variation of the distinguishing number in which every label may be used only once, and not every vertex need be labeled. We characterize the fixing sets of finite abelian groups, and investigate the fixing sets of symmetric groups.
An edge-coloring of a connected graph $G$ is called a {em monochromatic connection coloring} (MC-coloring for short) if any two vertices of $G$ are connected by a monochromatic path in $G$. For a connected graph $G$, the {em monochromatic connection number} (MC-number for short) of $G$, denoted by $mc(G)$, is the maximum number of colors that ensure $G$ has a monochromatic connection coloring by using this number of colors. This concept was introduced by Caro and Yuster in 2011. They proved that $mc(G)leq m-n+k$ if $G$ is not a $k$-connected graph. In this paper we depict all graphs with $mc(G)=m-n+k+1$ and $mc(G)= m-n+k$ if $G$ is a $k$-connected but not $(k+1)$-connected graph. We also prove that $mc(G)leq m-n+4$ if $G$ is a planar graph, and classify all planar graphs by their monochromatic connectivity numbers.
Graham and Pollak showed that the vertices of any graph $G$ can be addressed with $N$-tuples of three symbols, such that the distance between any two vertices may be easily determined from their addresses. An addressing is optimal if its length $N$ i s minimum possible. In this paper, we determine an addressing of length $k(n-k)$ for the Johnson graphs $J(n,k)$ and we show that our addressing is optimal when $k=1$ or when $k=2, n=4,5,6$, but not when $n=6$ and $k=3$. We study the addressing problem as well as a variation of it in which the alphabet used has more than three symbols, for other graphs such as complete multipartite graphs and odd cycles. We also present computations describing the distribution of the minimum length of addressings for connected graphs with up to $10$ vertices. Motivated by these computations we settle a problem of Graham, showing that most graphs on $n$ vertices have an addressing of length at most $n-(2-o(1))log_2 n$.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا