نتایج جستجو برای: vertex decomposable graph
تعداد نتایج: 216847 فیلتر نتایج به سال:
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
We call a vertex x of a graph G = (V,E) a codominated vertex if NG[y] ⊆ NG[x] for some vertex y ∈ V \{x}, and a graph G is called codismantlable if either it is an edgeless graph or it contains a codominated vertex x such that G − x is codismantlable. We show that (C4, C5)-free vertex-decomposable graphs are codismantlable, and prove that if G is a (C4, C5, C7)-free well-covered graph, then ver...
in this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially cohen-macaulay.
A n-vertex graph is said to be decomposable if for any partition (λ1, . . . , λp) of the integer n, there exists a sequence (V1, . . . , Vp) of connected vertex-disjoint subgraphs with |Vi| = λi. In this paper, we focus on decomposable trees. We show that a decomposable tree has degree at most 4. Moreover, each degree-4 vertex of a decomposable tree is adjacent to a leaf. This leads to a polyno...
A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n1, . . . , nk) of positive integers such that n1 + · · · + nk = n there exists a partition (V1, . . . , Vk) of the vertex set of G such that for each i ∈ {1, . . . , k}, Vi induces a connected subgraph of G on ni vertices. The main result of the paper reads as follows. Suppose that G is a connected graph o...
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
Let G be a graph of order n and r , 1 ≤ r ≤ n, a fixed integer. G is said to be r -vertex decomposable if for each sequence (n1, . . . , nr ) of positive integers such that n1 + · · · + nr = n there exists a partition (V1, . . . , Vr ) of the vertex set of G such that for each i ∈ {1, . . . , r}, Vi induces a connected subgraph of G on ni vertices. G is called arbitrarily vertex decomposable if...
A n-vertex graph is said to be decomposable if for any partition (λ1, . . . , λp) of the integer n, there exists a sequence (V1, . . . , Vp) of connected vertex-disjoint subgraphs with |Vi| = λi. The aim of the paper is to study the homeomorphism classes of decomposable trees. More precisely, we show that homeomorphism classes containing decomposable trees with an arbitrarily large minimal dist...
Let G = (V,E) be a graph. If G is a König graph or if G is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: ∆G is pure shellable, R/I∆ is Cohen-Macaulay, G is an unmixed vertex decomposable graph and G is well-covered with a perfect matching of König type e1, . . . , eg without 4-cycles with two ei’s. Furthermore, we study vertex decomposable and she...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید