Skip to search formSkip to main contentSkip to account menu

Graph (discrete mathematics)

Known as: Simple graph, Finite undirected graph, Undirected 
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Adjacency listB-coloringBipartite realization problemBridge (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Distributed Consensus With Limited Communication Data Rate
Communication data rate and energy constraints are important factors which have to be considered when investigating distributed… 
Highly Cited
2010
Highly Cited
2010
On Pinning Synchronization of Directed and Undirected Complex Dynamical Networks
This paper presents some low-dimensional pinning criteria for global synchronization of both directed and undirected complex… 
Highly Cited
2009
Highly Cited
2009
Distributed leaderless consensus algorithms for networked Euler–Lagrange systems
This article proposes and analyses distributed, leaderless, model-independent consensus algorithms for networked Euler–Lagrange… 
Highly Cited
2008
Highly Cited
2008
On consensus algorithms for double-integrator dynamics
This paper extends some existing results in consensus algorithms for double-integrator dynamics. We propose consensus algorithms… 
Highly Cited
2007
Highly Cited
2007
Accelerating Large Graph Algorithms on the GPU Using CUDA
Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical… 
Review
1995
Review
1995
Trends in Cancer Incidence and Mortality
A detailed summary of the contents and purpose of this book is contained in the foreword written by L Tomatis, the Director of… 
Highly Cited
1994
Highly Cited
1994
The Laplacian Spectrum of a Graph II
Let G be a graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then L(G) = D(G) - A… 
Highly Cited
1988
Highly Cited
1988
THERMAL PROPERTIES OF ROCKS
All the important thermal properties of rocks can be estimated from the graphs and tables in this report. Most of the useful… 
Highly Cited
1983
Highly Cited
1983
Degrees of acyclicity for hypergraphs and relational database schemes
Database schemes (winch, intuitively, are collecuons of table skeletons) can be wewed as hypergraphs (A hypergraph Is a… 
Highly Cited
1977
Highly Cited
1977
Optimal surface reconstruction from planar contours
In many scientific and technical endeavors, a three-dimensional solid must be reconstructed from serial sections, either to aid… 
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)