Theta Graph Designs
نویسندگان
چکیده مقاله:
We solve the design spectrum problem for all theta graphs with 10, 11, 12, 13, 14 and 15 edges.
منابع مشابه
Are Yao Graph and Theta Graph Void Free?
Greedy Forwarding algorithm is a widely-used routing algorithm for wireless networks. However, it can fail if the wireless network topologies contain void scenarios (or simply called voids). Since Yao Graph and Theta Graph are two types of geometric graphs exploited to construct wireless network topologies, this paper studies whether these two types of graphs can contain voids. Specifically, th...
متن کاملMetamorphosis problems for graph designs
A λ-fold G-design of order n is a pair (X, B), where B is a collection of edge disjoint copies of the simple graph G which partitions the edge set of λK n (the undirected complete graph with n vertices) with vertex set X. Let (X, B) be a G-design and H be a subgraph of G. For each block b ∈ B, partition b into copies of H and G \ H and place the copy of H in B(H) and the edges belonging to the ...
متن کاملA family of resolvable regular graph designs
A regular graph design RGD(v; k; r) is a design on v points with blocks of size k and constant replication number r, such that any two points belong to either 1 or 1 +1 common blocks, for some constant 1. We investigate resolvable regular graph designs with block size 4. In particular we determine the spectrum of such designs for v 16.
متن کاملEfficient Covering Designs of the Complete Graph
Let H be a graph. We show that there exists n0 = n0(H) such that for every n ≥ n0, there is a covering of the edges of Kn with copies of H where every edge is covered at most twice and any two copies intersect in at most one edge. Furthermore, the covering we obtain is asymptotically optimal.
متن کاملEecient Covering Designs of the Complete Graph
Let H be a graph. We show that there exists n 0 = n 0 (H) such that for every n n 0 , there is a covering of the edges of K n with copies of H where every edge is covered at most twice and any two copies intersect in at most one edge. Furthermore, the covering we obtain is asymptotically optimal.
متن کاملOn the Stretch Factor of the Theta-4 Graph
In this paper we show that the θ-graph with 4 cones has constant stretch factor, i.e., there is a path between any pair of vertices in this graph whose length is at most a constant times the Euclidean distance between that pair of vertices. This is the last θ-graph for which it was not known whether its stretch factor was bounded.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 49 شماره 1
صفحات 1- 16
تاریخ انتشار 2017-06-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023