Depth information in single triangles and arrays of triangles
نویسندگان
چکیده
منابع مشابه
G . Masala REGULAR TRIANGLES AND ISOCLINIC TRIANGLES IN
We give a complete set of orthogonal invariants for triangles in G2 ( n ). As a consequence we characterize regular triangles and isoclinic triangles and we exhibit the existence regions of these objects in comparison with the angular invariants associated to them.
متن کاملOn Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملEliminating Depth Cycles among Triangles in Three Dimensions
Given n non-vertical pairwise disjoint triangles in 3-space, their vertical depth (above/below) relation may contain cycles. We show that, for any ε > 0, the triangles can be cut into O(n3/2+ε) pieces, where each piece is a connected semi-algebraic set whose description complexity depends only on the choice of ε, such that the depth relation among these pieces is now a proper partial order. Thi...
متن کاملFrustrated triangles
A triple of vertices in a graph is a frustrated triangle if it induces an odd number of edges. We study the set Fn ⊂ [0, n 3 ] of possible number of frustrated triangles f (G) in a graph G on n vertices. We prove that about two thirds of the numbers in [0, n3/2] cannot appear in Fn, and we characterise the graphs G with f (G) ∈ [0, n3/2]. More precisely, our main result is that, for each n ≥...
متن کاملTractable Triangles
We study the computational complexity of binary valued constraint satisfaction problems (VCSP) given by allowing only certain types of costs in every triangle of variable-value assignments to three distinct variables. We show that for several computational problems, including CSP, Max-CSP, finite-valued VCSP, and general-valued VCSP, the only non-trivial tractable classes are the well known max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Psychonomic Science
سال: 1966
ISSN: 0033-3131
DOI: 10.3758/bf03328072