Skip to search formSkip to main contentSkip to account menu

Theta graph

In computational geometry, the Theta graph, or -graph, is a type of geometric spanner similar to a Yao graph. The basic method of construction… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations

Broader (2)

Computational geometryGeometric graph theory
Geometric spannerList coloringSemi-Yao graphYao graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On the automorphic sheaves for GSp_4
For G=GSp_4 we construct an automorphic sheaf correspinding to a G^L-local system on a curve X such that its standard… 
2019
2019
The Structure of the Orion Nebula in the Direction of θ1 Ori C
We have used existing optical emission and absorption lines, [C ii] emission lines, and H i absorption lines to create a new… 
2018
2018
Two More Proofs that the Kinoshita Graph is Knotted
Abstract The Kinoshita graph is a particular embedding in the 3-sphere of a graph with three edges, two vertices, and no loops… 
2018
2018
TOTAL EDGE IRREGULARITY STRENGTH OF GENERALIZED UNIFORM THETA GRAPH
Given a graph G ( V , E ) a labeling ∂: V ∪ E →{1,2,..., k } is called an edge irregular total k - labeling if for every pair of… 
2017
2017
Sum Divisor Cordial Labeling of Theta Graph
Abstract. A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,..., | |} V such that… 
2012
2012
Sharp bounds for the number of matchings in generalized-theta-graphs
A generalized-theta-graph is a graph consisting of a pair of end vertices joined by k (k ≥ 3) internally disjoint paths. We… 
2008
2008
Microsatellite variation of cassava (Manihot esculenta Crantz) in home gardens of Chibchan Amerindians from Costa Rica
We used 13 microsatellite marker loci to determine the genetic diversity of cassava (Manihot esculenta Crantz) grown in home… 
2004
2004
Security Analysis of MOR using GL(2, R) x Theta Z n .
2000
2000
The edge-bandwidth of theta graphs
An edge-labeling f of a graph G is an injection from E(G) to the set of integers. The edge-bandwidth of G is B′(G) = minf {B′(f… 
1998
1998
Characterizing planarity using theta graphs
A theta graph is a homeomorph of K 2;3. In an embedded planar graph the local rotation at one degree-three vertex of a theta… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)