Lévy Family Of Graphs
   HOME





Lévy Family Of Graphs
In graph theory, a branch of mathematics, a Lévy family of graphs is a family of graphs ''G''''n'', ''n'' = 1, 2, 3, ..., which possess a certain type of "compactness" or "tangledness". Many naturally occurring families of graphs are Lévy families. Many mathematicians have noted this fact and have expressed surprise that it does not appear to have a ready explanation. Formally, a family of graphs ''Gn'', ''n'' = 1, 2, 3, ..., is a Lévy family if, for any \varepsilon>0 : \lim_\alpha\left(G_n,\varepsilon\right) =0 where : \alpha(G,\varepsilon) = \max \left\. Here ''D'' is the graph diameter of ''G'', and ''A''(''n'') is the ''n''- graph neighborhood of ''A''. Note that the maximization ranges over subsets ''A'' of ''G'', subject to ''A'' being over half the size of ''G'' In words, this means that one can take a subset of size at least half of ''G'', and blow it up by only \epsilon of the graph diameter, and end up with nea ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Graph Theory
In mathematics and computer science, graph theory is the study of ''graph (discrete mathematics), graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of ''Vertex (graph theory), vertices'' (also called ''nodes'' or ''points'') which are connected by ''Glossary of graph theory terms#edge, edges'' (also called ''arcs'', ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a Set (mathematics), set of vertices (also called nodes or points); * ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Graph (discrete Mathematics)
In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a Set (mathematics), set of objects where some pairs of the objects are in some sense "related". The objects are represented by abstractions called ''Vertex (graph theory), vertices'' (also called ''nodes'' or ''points'') and each of the related pairs of vertices is called an ''edge'' (also called ''link'' or ''line''). Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person ''A'' can shake hands with a person ''B'' only if ''B'' also shakes hands with ''A''. In contrast, if an edge from a person ''A'' to a person ''B'' means that ''A'' owes money to ''B'', then this graph is directed, because owing mon ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Graph Diameter
In graph theory, the diameter of a connected undirected graph is the farthest distance between any two of its vertices. That is, it is the diameter of a set for the set of vertices of the graph, and for the shortest-path distance in the graph. Diameter may be considered either for weighted or for unweighted graphs. Researchers have studied the problem of computing the diameter, both in arbitrary graphs and in special classes of graphs. The diameter of a disconnected graph may be defined to be infinite, or undefined. Graphs of low diameter The degree diameter problem seeks tight relations between the diameter, number of vertices, and degree of a graph. One way of formulating it is to ask for the largest graph with given bounds on its degree and diameter. For any fixed degree, this maximum size is exponential in diameter, with the base of the exponent depending on the degree. The girth of a graph, the length of its shortest cycle, can be at most 2k+1 for a graph of diameter k ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  



MORE