In this work we study the shellability of graphs and clutters that have a simplicial vertex. We give characterizations of shellable graphs and clutters by using the properties of simplicial vertices, shedding vertices and shedding faces. We also introduce a family of recursively simplicial graphs and clutters.