Results 11 to 20 of about 51,101 (296)
Covering and radius-covering arrays: Constructions and classification [PDF]
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles J. Colbourn +3 more
openaire +3 more sources
Diameter, Covering Index, Covering Radius and Eigenvalues
European Journal of Combinatorics, 1991 An upper bound for the diameter of a regular graph in terms of the second largest eigenvalue (in absolute value) by \textit{F. R. K. Chung} [J. Am. Math. Soc. 2, No. 2, 187-195 (1989; Zbl 0678.05037)] has been generalized to the case of biregular graphs and regular directed graphs. The authors also discuss connections to finite nonabelian simple groups,
Charles Delorme, Patrick Solé
openaire +2 more sources
The Covering Radius of Spherical Designs
European Journal of Combinatorics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Solé, Patrick
openaire +3 more sources
Dynamic Hub Covering Problem with Flexible Covering Radius
International Journal of Industrial Engineering and Production Research, 2015 One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase
Yahia Zare Mehrjerdi +2 more
doaj +1 more source
The covering radius of permutation designs
Journal of Algebraic Combinatorics, 2022 A notion of $t$-designs in the symmetric group on $n$ letters was introduced by Godsil in 1988. In particular $t$-transitive sets of permutations form a $t$-design. We derive upper bounds on the covering radius of these designs, as a function of $n$ and $t$ and in terms of the largest zeros of Charlier polynomials.
Solé, Patrick
openaire +3 more sources
On the packing radius and the covering radius of equal-weight codes
Discrete Mathematics, 2000 The authors find the exact value of the packing radius of a well-known equal-weight code. They give the upper and lower bounds for this code's covering radius. Also the aspect of constructivity and complexity is discussed. In particular, the authors describe an efficient (polynomial) procedure that finds for each word of weight \(k\) (= the weight of ...
Stephen D. Cohen, Nikolai N. Kuzjurin
openaire +3 more sources
The covering radius of the cycle code of a graph
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patrick Solé, Thomas Zaslavsky
openaire +2 more sources
Saturating systems and the rank covering radius
CoRR, 2022 26 pages, to appear in Journal of Algebraic ...
Matteo Bonini +2 more
openaire +3 more sources
Mathematics, 2023 A fuzzy graph G is stated to have a set of trees as its tree cover if all the vertices of G are in their union. The maximum weight tree in the tree cover is assumed to be the cost of a tree cover for a fuzzy graph.
Anushree Bhattacharya, Madhumangal Pal
doaj +1 more source
Effective Approaches to Solve
IEEE Access, 2020 The classic p -center problem consists of choosing a set of p vertices in an undirected graph as facilities in order to minimize the maximum distance between each client vertex and its closest facility.
Xiaolu Liu +5 more
doaj +1 more source