A. Soleyman Jahan
Department of Mathematics, University of Kurdistan, P.O. Box 66177-15175, Sanadaj, Iran.
[ 1 ] - 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.
نویسندگان همکار