Sabitlenmiş Tweet
Network Fact
4.2K posts
Network Fact
@NetworkFact
Daily tweets about networks, graph theory, and related topics from @JohnDCook
Katılım Temmuz 2013
19 Takip Edilen46.4K Takipçiler
A regular graph is one in which all nodes have the same degree.
English
Applied algebraic topology and sensor networks math.upenn.edu/~ghrist/prepri… [24 MB pdf]
English
Python software for compressed sparse graphs: docs.scipy.org/doc/scipy/refe…
English
The original 'six degrees of separation' paper: 'An experimental study of the small world problem' cis.upenn.edu/~mkearns/teach… [pdf]
English
Mickey Mouse Sphere Theorem quantumcalculus.org/mickey-mouse-s…
English
The structure and function of complex networks www-personal.umich.edu/~mejn/courses/…
English
The genus of a graph is the lowest genus of any surface on which the graph can embed.
English
A graph is embeddable on a surface if its vertices and edges can be arranged on it without any crossing.
English
The eccentricity of a vertex v in a graph is the maximum distance from v to any other vertex.
English
'Graph theory in the information age' by Fan Chung math.ucsd.edu/~fan/wp/graph.…
English
The Euler characteristic = # 0-simplices - # of 1-simplices + # 2 simplices. This form generalizes to higher dimensions.
English
The Euler characteristic of a graph is V - E + F, number of vertices minus number of edges plus number of faces.
English
The 'Chinese postman problem' is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph.
English
The clique decision problem, determining whether a graph has a clique larger than a given size, is NP complete.
English
The Laplacian Spectrum of Graphs by Michael Newman seas.upenn.edu/~jadbabai/ESE6… [pdf]
English
The Laplacian Spectrum of Graphs by Bojan Mohar fmf.uni-lj.si/~mohar/Papers/… [pdf]
English