

Algebraic graph theory
Algebraic graph theory Algebraic graph theory is a branch of mathematics. In one sense, algebraic graph theory studies graphs in connection with ...
http://en.wikipedia.org/wiki/Algebraic_graph_theory  1k  Cached  Similar pages

Connectivity (graph theory)
Connectivity (graph theory) In mathematics and computer science, connectivity is one of the basic concepts of graph theory. It is closely related to the theory of network flow problems. The connectivity ...
http://en.wikipedia.org/wiki/Connectivity_(graph_theory)  9k  Cached  Similar pages

Closeness (graph theory)
Closeness (graph theory) Closeness is a centrality measure of a vertex within a graph. Vertices that are 'shallow' to other vertices ... distances to other vertices with in the graph) have higher closeness. Closeness is preferred in ... distances to all other vertices in the graph: $C\_C(v)=\backslash frac\{1\}\{\backslash sum\_\{\; ...$ http://en.wikipedia.org/wiki/Closeness_(graph_theory)  1k  Cached  Similar pages

Tournament (graph theory)
Tournament (graph theory) A tournament is a directed graph obtained by choosing a direction for each edge in an undirected complete graph. For example, here is a tournament on ... The name tournament originates from such a graph's interpretation as the outcome of ...
http://en.wikipedia.org/wiki/Tournament_(graph_theory)  4k  Cached  Similar pages

Degree (graph theory)
Degree (graph theory) This article is about the term "degree" as used in graph theory. For alternate meanings, see degree (mathematics) or degree. In the mathematical field of graph theory the degree or valency of ...
http://en.wikipedia.org/wiki/Degree_(graph_theory)  2k  Cached  Similar pages

Distance (graph theory)
Distance (graph theory) In the mathematical subfield of graph theory, the distance between two vertices in a graph is the number of edges in ...
http://en.wikipedia.org/wiki/Distance_(graph_theory)  3k  Cached  Similar pages

Snark (graph theory)
Snark (graph theory) The flower snark is one of 6 snarks on 20 vertices. In graph theory, a snark is a connected, bridgeless cubic graph with chromatic index equal to 4. ...
http://en.wikipedia.org/wiki/Snark_(graph_theory)  2k  Cached  Similar pages

Path (graph theory)
Path (graph theory) In mathematics, a path in a graph is a sequence of vertices such that ... The same concepts apply in a directed graph , with the edges being directed from each ... are the same by definition). In modern graph theory, most often "simple" is implied; ...
http://en.wikipedia.org/wiki/Path_(graph_theory)  3k  Cached  Similar pages

Spectral graph theory
Spectral graph theory In mathematics, spectral graph theory is the study of properties of a graph in relationship to the characteristic polynomials, ...
http://en.wikipedia.org/wiki/Spectral_graph_theory  3k  Cached  Similar pages

Extremal graph theory
Extremal graph theory Extremal graph theory is a branch of mathematics. In the narrow sense, extremal graph theory studies the graphs which are ...
http://en.wikipedia.org/wiki/Extremal_graph_theory  3k  Cached  Similar pages

Page: <<Previous 1 2 3 4 5 6 7 8 9 10 Next >> 