|
Degree Diameter
In graph theory, the degree diameter problem is the problem of finding the largest possible graph (in terms of the size of its vertex set ) of diameter such that the largest degree of any of the vertices in is at most . The size of is bounded above by the Moore bound; for and only the Petersen graph, the Hoffman-Singleton graph, and possibly one more graph (not yet proven to exist) of diameter and degree attain the Moore bound. In general, the largest degree-diameter graphs are much smaller in size than the Moore bound. Formula Let n_ be the maximum possible number of vertices for a graph with degree at most ''d'' and diameter ''k''. Then n_\leq M_, where M_ is the Moore bound: :M_=\begin1+d\frac&\textd>2\\2k+1&\textd=2\end This bound is attained for very few graphs, thus the study moves to how close there exist graphs to the Moore bound. For asymptotic behaviour note that M_=d^k+O(d^). Define the parameter \mu_k=\liminf_\frac. It is conjectured that \mu_k=1 for all ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''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 of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph (discrete Mathematics)
In discrete mathematics, and more specifically in graph theory, a graph is a structure amounting to a Set (mathematics), set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical 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. Graphs are one of the objects of study in discrete mathematics. 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'' m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex (graph Theory)
In discrete mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another. From the point of view of graph theory, vertices are treated as featureless and indivisible objects, although they may have additional structure depending on the application from which the graph arises; for instance, a semantic network is a graph in which the vertices represent concepts or classes of objects. The two vertices forming an edge are said to be the endpoints of this edge, and the edge is said to be incident to the vertices. A vertex ''w'' is said to be ad ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distance (graph Theory)
In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them. This is also known as the geodesic distance or shortest-path distance. Notice that there may be more than one shortest path between two vertices. If there is no path connecting the two vertices, i.e., if they belong to different connected components, then conventionally the distance is defined as infinite. In the case of a directed graph the distance between two vertices and is defined as the length of a shortest directed path from to consisting of arcs, provided at least one such path exists. Notice that, in contrast with the case of undirected graphs, does not necessarily coincide with —so it is just a quasi-metric, and it might be the case that one is defined while the other is not. Related concepts A metric space defined over a set of points in terms of distances in a graph defined over th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Degree (graph Theory)
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes 2 to a vertex's degree, for the two ends of the edge. The degree of a vertex v is denoted \deg(v) or \deg v. The maximum degree of a graph G, denoted by \Delta(G), and the minimum degree of a graph, denoted by \delta(G), are the maximum and minimum of its vertices' degrees. In the multigraph shown on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, every vertex has the same degree, and so we can speak of ''the'' degree of the graph. A complete graph (denoted K_n, where n is the number of vertices in the graph) is a special kind of regular graph where all vertices have the maximum possible degree, n-1. In a signed graph, the number of positive edges connected to the vertex v is called positive deg(v) and the number of connected negative edges is entitled negative deg(v). Handshaking lemma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moore Graph
In graph theory, a Moore graph is a regular graph whose girth (the shortest cycle length) is more than twice its diameter (the distance between the farthest two vertices). If the degree of such a graph is and its diameter is , its girth must equal . This is true, for a graph of degree and diameter , if and only if its number of vertices equals :1+d\sum_^(d-1)^i, an upper bound on the largest possible number of vertices in any graph with this degree and diameter. Therefore, these graphs solve the degree diameter problem for their parameters. Another equivalent definition of a Moore graph is that it has girth and precisely cycles of length , where and are, respectively, the numbers of vertices and edges of . They are in fact extremal with respect to the number of cycles whose length is the girth of the graph. Moore graphs were named by after Edward F. Moore, who posed the question of describing and classifying these graphs. As well as having the maximum possible number ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Petersen Graph
In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by . Kempe observed that its vertices can represent the ten lines of the Desargues configuration, and its edges represent pairs of lines that do not meet at one of the ten points of the configuration. Donald Knuth states that the Petersen graph is "a remarkable configuration that serves as a counterexample to many optimistic predictions about what might be true for graphs in general." The Petersen graph also makes an appearance in tropical geometry. The cone over the Petersen graph is naturally identif ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moore Bound
In graph theory, a Moore graph is a regular graph whose girth (the shortest cycle length) is more than twice its diameter (the distance between the farthest two vertices). If the degree of such a graph is and its diameter is , its girth must equal . This is true, for a graph of degree and diameter , if and only if its number of vertices equals :1+d\sum_^(d-1)^i, an upper bound on the largest possible number of vertices in any graph with this degree and diameter. Therefore, these graphs solve the degree diameter problem for their parameters. Another equivalent definition of a Moore graph is that it has girth and precisely cycles of length , where and are, respectively, the numbers of vertices and edges of . They are in fact extremal with respect to the number of cycles whose length is the girth of the graph. Moore graphs were named by after Edward F. Moore, who posed the question of describing and classifying these graphs. As well as having the maximum possible numbe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cage (graph Theory)
In the mathematical area of graph theory, a cage is a regular graph that has as few vertices as possible for its girth. Formally, an is defined to be a graph in which each vertex has exactly neighbors, and in which the shortest cycle has length exactly . An is an with the smallest possible number of vertices, among all . A is often called a . It is known that an exists for any combination of and . It follows that all exist. If a Moore graph exists with degree and girth , it must be a cage. Moreover, the bounds on the sizes of Moore graphs generalize to cages: any cage with odd girth must have at least :1+r\sum_^(r-1)^i vertices, and any cage with even girth must have at least :2\sum_^(r-1)^i vertices. Any with exactly this many vertices is by definition a Moore graph and therefore automatically a cage. There may exist multiple cages for a given combination of and . For instance there are three nonisomorphic , each with 70 vertices: the Balaban 10-cage, the Ha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Table Of Graphs
In graph theory, the degree diameter problem is the problem of finding the largest possible graph for a given maximum degree and diameter. The Moore bound sets limits on this, but for many years mathematicians in the field have been interested in a more precise answer. The table below gives current progress on this problem (excluding the case of degree 2, where the largest graphs are cycles with an odd number of vertices). Table of the orders of the largest known graphs for the undirected degree diameter problem Below is the table of the vertex numbers for the best-known graphs (as of July 2022) in the undirected degree diameter problem In graph theory, the degree diameter problem is the problem of finding the largest possible graph (in terms of the size of its vertex set ) of diameter such that the largest degree of any of the vertices in is at most . The size of is bounde ... for graphs of degree at most 3 ≤ ''d'' ≤ 16 and diameter 2 ≤&nbs ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Table Of Vertex-symmetric Digraphs
The best known vertex transitive digraphs (as of October 2008) in the directed Degree diameter problem In graph theory, the degree diameter problem is the problem of finding the largest possible graph (in terms of the size of its vertex set ) of diameter such that the largest degree of any of the vertices in is at most . The size of is bounde ... are tabulated below. Table of the orders of the largest known vertex-symmetric graphs for the directed degree diameter problem Key to colors References * * * * * * {{citation , last1 = Loz , first1 = Eyal , last2 = Širáň , first2 = Jozef , title = New record graphs in the degree-diameter problem , journal = Australasian Journal of Combinatorics , volume = 41 , year = 2008 , pages = 63–80 , url = http://ajc.maths.uq.edu.au/pdf/41/ajc_v41_p063.pdf External links Vertex-symmetric Digraphsonline table. The Degree - Diameter Problem on CombinatoricsWiki.org Eyal Loz'sDegree-Diamet ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Degree (graph Theory)")
.svg "Click for more on -> Petersen Graph")