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