Competition Numbers of a Kind of Pseudo-Halin Graphs
نویسندگان
چکیده
For any graph G , G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number ( ) k G of a graph G is defined to be the smallest number of such isolated vertices. In general, it is hard to compute the competition number ( ) k G for a graph G and characterizing a graph by its competition number has been one of important research problems in the study of competition graphs. A 2-connected planar graph G with minimum degree at least 3 is a pseudo-Halin graph if deleting the edges on the boundary of a single face 0 f yields a tree. It is a Halin graph if the vertices of 0 f all have degree 3 in G . In this paper, we compute the competition numbers of a kind of pseudo-Halin graphs.
منابع مشابه
The locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملOne- and two-page crossing numbers for some types of graphs
The simplest graph drawing method is that of putting the vertices of a graph on a line (spine) and drawing the edges as half-circles on k half planes (pages). Such drawings are called k-page book drawings and the minimal number of edge crossings in such a drawing is called the k-page crossing number. In a one-page book drawing, all edges are placed on one side of the spine, and in a two-page bo...
متن کاملOuterplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one straight-line segment. We derive exact results for the minimal number of crossings in any outerplanar drawings of the following classes of graphs: 3-row meshes, Halin graphs and complete p−partite graphs with equal size...
متن کاملEmbeddings of Cubic Halin Graphs: Genus Distributions∗
We derive an O(n)-time algorithm for calculating the genus distribution of a given 3-regular Halin graph G; that is, we calculate the sequence of numbers g0(G), g1(G), g2(G), . . . on the respective orientable surfaces S0, S1, S2, . . . . Key topological features are a quadrangular decomposition of plane Halin graphs and a new recombinant-strands reassembly process that fits pieces together thr...
متن کاملLovász-Plummer conjecture on Halin graphs
A Halin graph, defined by Halin [3], is a plane graph H = T ∪ C such that T is a spanning tree of H with no vertices of degree 2 where |T | ≥ 4 and C is a cycle whose vertex set is the set of leaves of T . In his work, as an example of a class of edge-minimal 3-connected plane graphs, Halin constructed this family of plane graphs, which have many interesting properties. Lovász and Plummer [5] n...
متن کامل