Theta Graph Designs

Authors

  • Anthony D. Forbes Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, UK.
  • Terry S. Griggs Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, UK.
Abstract:

We solve the design spectrum problem for all theta graphs with 10, 11, 12, 13, 14 and 15 edges.

Download for Free

Sign up for free to access the full text

Already have an account?login

similar resources

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...

full text

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 ...

full text

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.

full text

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.

full text

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.

full text

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.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 49  issue 1

pages  1- 16

publication date 2017-06-01

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023