منابع مشابه
Various Parameters of Subgraphs and Supergraphs of the Hypercube
OF DISSERTATION Submitted in the partial fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate School of Arts and Sciences of Northeastern University, April 2009
متن کاملOn Supergraphs Satisfying CMSO Properties
Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function f , there is an algorithm A that takes as input a CMSO sentence φ, a positive integer t, and a connected graph G of maximum degree at most ∆, and determines, in time f(|φ|, t) · 2O(∆·t) · |G|O(t), whether G has a supergraph G′ of treewidth at most t such that G′ |= φ...
متن کاملFault tolerant supergraphs with automorphisms
Given a basic graph Y and a desired level of fault-tolerance k, an objective in fault-tolerant system design is to construct a supergraph X such that the removal of any k nodes from X leaves a graph containing Y . In order to reconfigure around faults when they occur, it is also required that any two subsets of k nodes of X are in the same orbit of the action of its automorphism group. In this ...
متن کامل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...
متن کاملOn Strong Chromatic Index of Halin Graph
A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, are assigned different colors. The strong chromatic index of G is the smallest number k for which G has a strong k-edge-coloring. A Halin graph is a planar graph consisting of a tree with no vertex of degree tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)e0131-h