Article

constructing vertex decomposable graphs

constructing vertex decomposable graphs

Download full textFree with an account; signing up with Google takes seconds

Abstract

‎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‎.

Similar items

  • Constructing vertex decomposable graphs

    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 construct

  • Vertex-Decomposable Graphs, Codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford Regularity

    Open-access article2014The Electronic Journal of CombinatoricsTürkerBıyıkoğlu, YusufCivan

    We call a vertex $x$ of a graph $G=(V,E)$ a codominated vertex if $N_G[y]\subseteq N_G[x]$ for some vertex $y\in V\backslash \{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 codismantlabl

  • Vertex-decomposable Graphs, Codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford Regularity

    Scholarly record2014Electr. J. Comb.Türker Bíyíkoglu, Yusuf Civan

    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 v

  • An Ore-type condition for arbitrarily vertex decomposable graphs

    Scholarly record2005Discrete MathematicsAntoni Marczyk

    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

  • Dense Arbitrarily Vertex Decomposable Graphs

    Scholarly record2012Graphs and CombinatoricsMirko Hornák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak

    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 connect

  • A note on arbitrarily vertex decomposable graphs

    Scholarly record2005Antoni Marczyk

    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