مقاله

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 construction to generalize the result due to Cook and Nagel.

نویسندگان و وابستگی سازمانی
  1. E. Lashani — Department of Mathematics, Science and Research branch, Islamic Azad University(IAU), Tehran, Iran.
  2. A. Soleyman JahanORCID 0000-0001-8117-881X — Department of Mathematics, University of Kurdistan, P.O. Box 66177-15175, Sanadaj, Iran.

شکل‌ها (۱)

  • Figure 3.4.
    Figure 3.4.صفحه‌ی ۹

شکل‌ها از متن کامل مقاله برداشته شده‌اند و حقوقشان از آنِ نویسندگان و ناشر است. منبع: صفحه‌ی اصلی مقاله

اسناد مشابه

  • constructing vertex decomposable graphs

    مقالهbulletin of the iranian mathematical societye. lashani, department of mathematics‎, ‎science and research‎ ‎branch‎, ‎islamic azad university(iau)‎, ‎tehran‎, ‎iran. a. soleyman jahan, department of mathematics‎, ‎university of kurdistan‎, ‎p.o‎. ‎box 66177-15175‎, ‎sanadaj‎, ‎iran‎.

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

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

    مقاله‌ی دسترسی آزاد۲۰۱۴The 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

    سند علمی۲۰۱۴Electr. 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

    سند علمی۲۰۰۵Discrete 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

    سند علمی۲۰۱۲Graphs 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

    سند علمی۲۰۰۵Antoni 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