Buscar
Mostrando ítems 31-40 de 64
Artículo
A new 2D tessellation for angle problems: The polar diagram
(2006)
The new approach we propose in this paper is a plane partition with similar features to those of the Voronoi Diagram, but the Euclidean minimum distance criterion is replaced for the minimal angle criterion. The result is ...
Artículo
On Sedlacek's C-Graphs
(Societatea de Științe Matematice din România, 1993)
In this Note, we study some properties of Sedlacek's C-graphs (see [3], [4] and [5]). In particular, we give new methods to build infinite families of C-graphs starting by a C-graph, and we study the relationship between ...
Artículo
Artículo
The seven-triangle longest-side partition of triangles and mesh quality improvement
(Elsevier, 2008)
A new triangle partition, the seven-triangle longest-edge partition, based on the trisection of the edges is presented and the associated mesh quality improvement property, discussed. The seven-triangle longest-edge ...
Artículo
Hexagonal Tilings and Locally C6 Graphs
(Cornell University, 2005)
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural embedding in the torus or in the Klein bottle (see [12]). We also show that locally grid graphs, ...
Artículo
On the metric dimension, the upper dimension and the resolving number of graphs
(2013)
This paper deals with three resolving parameters: the metric dimension, the upper dimension and the resolving number. We first answer a question raised by Chartrand and Zhang asking for a characterization of the graphs ...
Artículo
On a visibility representation of graphs
(1996)
We give a visibility representation of graphs which extends some very well-known representations considered extensively in the literature. Concretely, the vertices are represented by a collection of parallel hyper-rectangles ...
Artículo
Geometric Realization of Möbius Triangulations
(2008)
A Möbius triangulation is a triangulation on the Möbius band. A geometric realization of a map M on a surface $\Sigma$ is an embedding of $\Sigma$ into a Euclidean 3-space $\mathbb{R}^3$ such that each face of M is a flat ...
Artículo
The difference between the metric dimension and the determining number of a graph
(2014)
We study the maximum value of the difference between the metric dimension and the determining number of a graph as a function of its order. We develop a technique that uses functions related to locating-dominating sets to ...
Artículo
Continuous mean distance of a weighted graph
(Cornell University, 2021)
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be de ned as the arithmetic mean of the distances between all pairs of vertices. This ...