Some new results on the covering numbers N(t,k,v)

1980 ◽  
pp. 51-58 ◽  
Author(s):  
R. G. Stanton ◽  
R. C. Mullin
Keyword(s):  
Covering Numbers

Deficiencies and Vertex Clique Covering Numbers of Cubic Graphs

2017 ◽  
pp. 51-72
Author(s):  
L. Caccetta ◽  
Purwanto
Keyword(s):  
Cubic Graphs ◽  
Covering Numbers

Covering Numbers of $$L_{p}$$ L p -Balls of Convex Functions and Sets

2015 ◽  
Vol 43 (1) ◽  
pp. 135-151 ◽  
Author(s):  
Adityanand Guntuboyina
Keyword(s):  
Convex Functions ◽  
Covering Numbers

Bounding Covering Numbers

1999 ◽  
pp. 247-257
Keyword(s):  
Covering Numbers

On clique covering numbers of cubic graphs

1983 ◽  
pp. 121-127 ◽  
Author(s):  
Louis Caccetta ◽  
Norman J. Pullman
Keyword(s):  
Cubic Graphs ◽  
Covering Numbers

Covering Numbers in Covering-Based Rough Sets

2011 ◽  
pp. 72-78 ◽  
Author(s):  
Shiping Wang ◽  
Fan Min ◽  
William Zhu
Keyword(s):  
Rough Sets ◽  
Covering Numbers

scholarly journals Functional Covering Numbers

2019 ◽  
Author(s):  
Shiri Artstein-Avidan ◽  
Boaz A. Slomka
Keyword(s):  
Covering Numbers

Average covering number for some graphs

2019 ◽  
Vol 53 (1) ◽  
pp. 261-268
Author(s):  
D. Doğan Durgun ◽  
Ali Bagatarhan
Keyword(s):  
Interconnection Networks ◽  
Undirected Graph ◽  
Cartesian Product ◽  
Covering Number ◽  
Minimum Cardinality ◽  
Covering Numbers ◽  
Covering Set ◽  
Local Covering

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 $ \overline{\beta }(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\subseteq 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 Sv. The local covering number with respect to v is the minimum cardinality of among the Sv sets and denoted by βv. The average covering number of a graph G is defined as β̅(G) = 1/|v(G)| ∑ν∈v(G)βν In this paper, the average covering numbers of kth power of a cycle $ {C}_n^k$ and Pn □ Pm, Pn □ Cm, cartesian product of Pn and Pm, cartesian product of Pn and Cm are given, respectively.

Generalization Performance of Classifiers in Terms of Observed Covering Numbers

1999 ◽  
pp. 274-285 ◽  
Author(s):  
John Shawe-Taylor ◽  
Robert C. Williamson
Keyword(s):  
Generalization Performance ◽  
Covering Numbers

Covering Numbers in Linear Algebra

2012 ◽  
Vol 119 (1) ◽  
pp. 65 ◽  
Author(s):  
Pete L. Clark
Keyword(s):  
Linear Algebra ◽  
Covering Numbers
Sign in / Sign up

Export Citation Format

Share Document