Simplicial Graphs and Relationships to Different Graph Invariants

In this paper we show that simplicial graphs, in which every vertex belongs to exactly one simplex, characterize graphs satisfying equality in some graph invariants concerning independence, clique covering, domination or distance.