Skip to search formSkip to main contentSkip to account menu

Vertex (graph theory)

Known as: Node, Vertex, Node (graph) 
In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Adjacency listBabelfyBidirectional searchBiological network

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
New existence proofs ε-nets
We describe a new technique for proving the existence of small μ-nets for hypergraphs satisfying certain simple conditions. The… 
Highly Cited
2006
Highly Cited
2006
Engineering Multi-Level Overlay Graphs for Shortest-Path Queries
An overlay graph of a given graph G = (V, E) on a subset S ⊆ V is a graph with vertex set S that preserves some property of G. In… 
Highly Cited
2003
Highly Cited
2003
A glycidyl methacrylate-based resin with pendant urea groups as a high capacity mercury specific sorbent
Highly Cited
2001
Highly Cited
2001
Refined Search Tree Technique for Dominating Set on Planar Graphs 1
We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an… 
Highly Cited
1991
Highly Cited
1991
Constructing multidimensional spanner graphs
Given a connected graph G=(V,E) with positive edge weights, define the distance dG(u,v) between vertices u and v to be the length… 
Highly Cited
1985
Highly Cited
1985
Graph-encoded 3-manifolds
Highly Cited
1984
Highly Cited
1984
Applications of topological electron-counting theory to polyhedral metal clusters
Application de la theorie de comptage des electrons, developpee ibid, 1251-1257, a un grand nombre d'agregats polynucleaires de… 
Highly Cited
1979
Highly Cited
1979
Range-Data Analysis Guided by a Junction Dictionary
1978
1978
A good algorithm for smallest spanning trees with a degree constraint
Given a connected graph with edge costs, we seek a spanning tree having a specified degree at one vertex r, with cost as small as… 
Highly Cited
1976
Highly Cited
1976
On triangulations for computing fixed points
This paper introduces theoretical measures of efficiency for triangulations used in computing fixed points. The measures, for… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)