Convex embedding
id:
convex-embedding-264-5115158
title:
Convex embedding
text:
In geometric graph theory, a convex embedding of a graph is an embedding of the graph into a Euclidean space, with its vertices represented as points and its edges as line segments, so that all of the vertices outside a specified subset belong to the convex hull of their neighbors. More precisely, if X is a subset of the vertices of the graph, then a convex X -embedding embeds the graph in such a way that every vertex either belongs to X or is placed within the convex hull of its neighbors. A co
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Convex_embedding
date created:
date modified:
2023-12-05T02:43:39Z
main entity:
{"identifier":"Q97798739","url":"https://www.wikidata.org/entity/Q97798739"}
image:
fields total:
13
integrity:
13