AVERAGE COVERING NUMBER FOR SOME GRAPHS
No Thumbnail Available
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The interconnection networks are modeled by means of graphs to determine the reliability and vulnerability. There are lots of parameters that are used to determine vulnerability. The average covering number is one of them which is denoted by (beta) over bar (G) , where G is simple, connected and undirected graph of order n >= 2. In a graph G = (V (G), E(G)) a subset S-v subset of V (G) of vertices is called a cover set of G with respect to v or a local covering set of vertex v, if each edge of the graph is incident to at least one vertex of S-v. The local covering number with respect to v is the minimum cardinality of among the S-v sets and denoted by beta(v) The average covering number of a graph G is defined as (beta) over bar (G) = 1/vertical bar V(G)vertical bar Sigma(v is an element of V(G)) beta(v). In this paper, the average covering numbers of kth power of a cycle C-n(k) and P-n square p(m), P-n, square C-m, cartesian product of P-n, and P-m cartesian product of P-n, and C-m are given, respectively.