نتایج جستجو برای: k center steiner harary index
تعداد نتایج: 1021890 فیلتر نتایج به سال:
A partial Steiner (k, l)-system is a k-uniform hypergraph G with the property that every l-element subset of V is contained in at most one edge of G . In this paper we show that for given k, l and t there exists a partial Steiner (k, l)-system such that whenever an l-element subset from every edge is chosen, the resulting l-uniform hypergraph contains a clique of size t. As the main result of t...
We introduce a family of multi-way Cheeger-type constants {h k , k = 1, 2, . . . , N} on a signed graph Γ = (G, σ) such that h k = 0 if and only if Γ has k balanced connected components. These constants are switching invariant and bring together in a unified viewpoint a number of important graph-theoretical concepts, including the classical Cheeger constant, the non-bipartiteness parameter of D...
The q-analogs of covering designs, Steiner systems, and Turán designs are studied. It is shown that q-covering designs and q-Turán designs are dual notions. A strong necessary condition for the existence of Steiner structures (the q-analogs of Steiner systems) over F2 is given. No Steiner structures of strength 2 or more are currently known, and our condition shows that their existence would im...
Richard L. Guerrant, Thomas Van Gilder, Ted S. Steiner, Nathan M. Thielman, Laurence Slutsker, Robert V. Tauxe, Thomas Hennessy, Patricia M. Griffin, Herbert DuPont, R. Bradley Sack, Phillip Tarr, Marguerite Neill, Irving Nachamkin, L. Barth Reller, Michael T. Osterholm, Michael L. Bennish, and Larry K. Pickering University of Virginia, Charlottesville; Centers for Disease Control and Preventio...
The diameter of a graph is an important factor for communication as it determines the maximum communication delay between any pair of processors in a network. Graham and Harary [N. Graham, F. Harary, Changing and unchanging the diameter of a hypercube, Discrete Applied Mathematics 37/38 (1992) 265–274] studied how the diameter of hypercubes can be affected by increasing and decreasing edges. Th...
A partial Steiner system Sp(t, k, n) is a collection of k-subsets (i.e. subsets of size k) of n element set such that every t-subset is contained in at most one k-subset. To avoid trivial cases, we assume 2 ≤ t < k < n. It is easy to see that the size of a partial Steiner system Sp(t, k, n) is at most ( n t )
We design combinatorial approximation algorithms for the Capacitated Steiner Network (Cap-SN) problem and the Capacitated Multicommodity Flow (Cap-MCF) problem. These two problems entail satisfying connectivity requirements when edges have costs and hard capacities. In Cap-SN, the flow has to be supported separately for each commodity while in Cap-MCF, the flow has to be sent simultaneously for...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید