complete graph


Also found in: Wikipedia.

complete graph

[kəm¦plēt ′graf]
(mathematics)
A graph with exactly one edge connecting each pair of distinct vertices and no loops.

complete graph

A graph which has a link between every pair of nodes. A complete bipartite graph can be partitioned into two subsets of nodes such that each node is joined to every node in the other subset.
References in periodicals archive ?
The second modules creates the complete graph with the dataset specifying all the properties and relationship .
n-1], Cayley's formula for the number of spanning trees of the complete graph [K.
n] denote respectively, the complete graph on n [greater than or equal to] 1 vertices, the chordless path on n [greater than or equal to] 1 vertices, and the chordless cycle on n [greater than or equal to] 3 vertices.
For example we consider a complete graph where an edge exists between every pair of vertices
Here we have studied some theoretical investigation relating to the existence of binary tree, regular graphs having degree 1 and degree 2 and the complete graph from the graphical parts of the numbers (2n + 4), (4n + 4), (n + 1)(n + 2), (6n + 2) for n [greater than or equal to] 1 .
The clustering coefficient of a vertex in a graph quantifies how close the vertex and its neighbors are to being a complete graph, or clique.
A complete graph is a graph that has an edge between any two vertices.
s](G) (ii) For any complete graph G, [mu](G) [less than or equal to] [[gamma].
Up to now, the spectra are known for some particular graphs: path, cycle, complete graph, complete bipartite graph, complete tree, hypercube, k-dimensional lattice, star graph, etc.
You will want to modify the graph, before proceeding so you have one complete graph.
Using a patented social network engine to create a complete graph of company relationships, Spoke enables companies and other organizations to discover relationship capital assets that may have been previously hidden or unknown.
A (G,H)-multidesign of order n is a collection of subgraphs of the complete graph on n vertices, each one of which is either isomorphic to G or to H, such that each edge of the complete graph on n vertices is in exactly one of these subgraphs.