If a network modeled by a graph, then there are various graph
theoretical parameters used to express the vulnerability of communication
networks. One of them is the concept of integrity. In this paper, we determine exact values for the integrity of wheel related graphs.
