A note on harmonic subgraphs in labelled geometric graphs
Article
-
- Overview
-
- Research
-
- Identity
-
- Additional Document Info
-
- View All
-
Overview
abstract
-
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, ..., n - 1}. Each edge (the straight segment that joins two points) is labelled with the sum of the labels of its endpoints. In this note we investigate the maximum size of noncrossing matchings and paths on S, under the requirement that no two edges have the same weight. © 2007 Elsevier B.V. All rights reserved.
publication date
funding provided via
published in
Research
keywords
-
Computational geometry; Graceful labellings; Harmonic subgraphs Computational geometry; Harmonic analysis; Numerical methods; Graceful labellings; Harmonic subgraphs; Graph theory
Identity
Digital Object Identifier (DOI)
Additional Document Info
start page
end page
volume
issue