Skip to search formSkip to main contentSkip to account menu

Convex subgraph

In metric graph theory, a convex subgraph of an undirected graph G is a subgraph that includes every shortest path in G between two of its vertices… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Convex setMedian graphPartial cube

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Partial cubes without $Q_3^-$ minors
We investigate the structure of isometric subgraphs of hypercubes (i.e., partial cubes) which do not contain finite convex… 
2014
2014
Location of Zeroes of Convex Subgraph Polynomial
A subset of a vertex set of a connected graph is convex if the vertex set of every geodesic connecting any two vertices in is… 
2008
2008
CONVEX (ANTI)MEDIAN SUBGRAPHS OF GRAPHS
The distance DG(v) of a vertex v in an undirected graph G is the sum of the distances between v and all other vertices of G. The… 
2008
2008
An Algorithm for Finding Connected Convex Subgraphs of an Acyclic Digraph
A subgraph H of an acyclic digraph D is convex if there is no directed path between vertices of H which contains an arc not in H… 
2007
2007
Antimedian and median subsets of graphs ∗
A profile on a graph G is a finite sequence of vertices of G. The remoteness of a vertex u is the sum of distances to the… 
1998
1998
RELATIONS BETWEEN MEDIAN GRAPHS , SEMI-MEDIAN GRAPHS AND PARTIAL
A rich structure theory has been developed in the last three decades for graphs embed dable into hypercubes in particular for…