|
Regular Graphs
In graph theory, a regular graph is a Graph (discrete mathematics), graph where each Vertex (graph theory), vertex has the same number of neighbors; i.e. every vertex has the same Degree (graph theory), degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each vertex are equal to each other. A regular graph with vertices of degree is called a graph or regular graph of degree . Also, from the handshaking lemma, a regular graph contains an even number of vertices with odd degree. Regular graphs of degree at most 2 are easy to classify: a graph consists of disconnected vertices, a graph consists of disconnected edges, and a graph consists of a disjoint union of graphs, disjoint union of cycle (graph theory), cycles and infinite chains. A graph is known as a cubic graph. A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number of neighbors in common, and every non- ... [...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] |
Hamiltonian Cycle
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a cycle that visits each vertex exactly once. A Hamiltonian path that starts and ends at adjacent vertices can be completed by adding one more edge to form a Hamiltonian cycle, and removing any edge from a Hamiltonian cycle produces a Hamiltonian path. Determining whether such paths and cycles exist in graphs (the Hamiltonian path problem and Hamiltonian cycle problem) are NP-complete. Hamiltonian paths and cycles are named after William Rowan Hamilton who invented the icosian game, now also known as ''Hamilton's puzzle'', which involves finding a Hamiltonian cycle in the edge graph of the dodecahedron. Hamilton solved this problem using the icosian calculus, an algebraic structure based on roots of unity with many similarities to the quaternions (also invented by Hami ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Highly Irregular Graph
In graph theory, a highly irregular graph is a graph in which, for every vertex, all neighbors of that vertex have distinct degrees. History Irregular graphs were initially characterized by Yousef Alavi, Gary Chartrand, Fan Chung, Paul Erdős, Ronald Graham, and Ortrud Oellermann Ortrud R. Oellermann is a South African mathematician specializing in graph theory. She is a professor of mathematics at the University of Winnipeg. Education and career Oellermann was born in Vryheid. She earned a bachelor's degree, ''cum laude .... Chartrand, Gary, Paul Erdos, and Ortrud R. Oellermann. "How to define an irregular graph." College Math. J 19.1 (1988): 36–42. They were motivated to define the ‘opposite’ of a regular graph, a concep ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cage Graph
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 ... [...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] |
Strongly Regular Graph
In graph theory, a strongly regular graph (SRG) is defined as follows. Let be a regular graph with vertices and degree . is said to be strongly regular if there are also integers and such that: * Every two adjacent vertices have common neighbours. * Every two non-adjacent vertices have common neighbours. The complement of an is also strongly regular. It is a . A strongly regular graph is a distance-regular graph with diameter 2 whenever μ is non-zero. It is a locally linear graph whenever . Etymology A strongly regular graph is denoted an srg(''v'', ''k'', λ, μ) in the literature. By convention, graphs which satisfy the definition trivially are excluded from detailed studies and lists of strongly regular graphs. These include the disjoint union of one or more equal-sized complete graphs, and their complements, the complete multipartite graphs with equal-sized independent sets. Andries Brouwer and Hendrik van Maldeghem (see #References) use an alternate but fu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Random Regular Graph
A random ''r''-regular graph is a graph selected from \mathcal_, which denotes the probability space of all ''r''-regular graphs on n vertices, where 3 \le r 0 is a positive constant, and d is the least integer satisfying (r-1)^ \ge (2 + \epsilon)rn \ln n then, asymptotically almost surely, a random ''r''-regular graph has diameter at most ''d''. There is also a (more complex) lower bound on the diameter of ''r''-regular graphs, so that almost all ''r''-regular graphs (of the same size) have almost the same diameter. The distribution of the number of short cycles is also known: for fixed m \ge 3, let Y_3,Y_4,...Y_m be the number of cycles of lengths up to m. Then the Y_iare asymptotically independent Poisson random variables with means \lambda_i=\frac Algorithms for random regular graphs It is non-trivial to implement the random selection of ''r''-regular graphs efficiently and in an unbiased way, since most graphs are not regular. The ''pairing model'' (also ''configuration ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Graph Theory
The ''Journal of Graph Theory'' is a peer-reviewed mathematics journal specializing in graph theory and related areas, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. It is published by John Wiley & Sons. The journal was established in 1977 by Frank Harary.Frank Harary a biographical sketch at the ACM site The are [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adjacency Algebra
In algebraic graph theory, the adjacency algebra of a graph ''G'' is the algebra of polynomials in the adjacency matrix ''A''(''G'') of the graph. It is an example of a matrix algebra and is the set of the linear combinations of powers of ''A''.Algebraic graph theory, by Norman L. Biggs Norman Linstead Biggs (born 2 January 1941) is a leading British mathematician focusing on discrete mathematics and in particular algebraic combinatorics.. Education Biggs was educated at Harrow County Grammar School and then studied mathemat ..., 1993, p. 9/ref> Some other similar mathematical objects are also called "adjacency algebra". Properties Properties of the adjacency algebra of ''G'' are associated with various spectral, adjacency and connectivity properties of ''G''. ''Statement''. The number of walks of length ''d'' between vertices ''i'' and ''j'' is equal to the (''i'', ''j'')-th element of ''Ad''. ''Statement''. The dimension of the adjacency algeb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matrix Of Ones
In mathematics, a matrix of ones or all-ones matrix is a matrix where every entry is equal to one. Examples of standard notation are given below: :J_2 = \begin 1 & 1 \\ 1 & 1 \end;\quad J_3 = \begin 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end;\quad J_ = \begin 1 & 1 & 1 & 1 & 1 \\ 1 & 1 & 1 & 1 & 1 \end;\quad J_ = \begin 1 & 1 \end.\quad Some sources call the all-ones matrix the unit matrix, but that term may also refer to the identity matrix, a different matrix. A vector of ones or all-ones vector is matrix of ones having row or column form; it should not be confused with ''unit vectors''. Properties For an matrix of ones ''J'', the following properties hold: * The trace of ''J'' equals ''n'', and the determinant equals 0 for ''n'' ≥ 2, but equals 1 if ''n'' = 1. * The characteristic polynomial of ''J'' is (x - n)x^. * The minimal polynomial of ''J'' is x^2-nx. * The rank of ''J'' is 1 and the eigenvalues are ''n'' with multiplicity 1 and 0 with multiplicity . * J^k = ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Perron–Frobenius Theorem
In matrix theory, the Perron–Frobenius theorem, proved by and , asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding eigenvector can be chosen to have strictly positive components, and also asserts a similar statement for certain classes of nonnegative matrices. This theorem has important applications to probability theory (ergodicity of Markov chains); to the theory of dynamical systems ( subshifts of finite type); to economics ( Okishio's theorem, Hawkins–Simon condition); to demography ( Leslie population age distribution model); to social networks ( DeGroot learning process); to Internet search engines (PageRank); and even to ranking of football teams. The first to discuss the ordering of players within tournaments using Perron–Frobenius eigenvectors is Edmund Landau. Statement Let positive and non-negative respectively describe matrices with exclusively positive real numbers as elements and matrices ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Eigenvalue
In linear algebra, an eigenvector () or characteristic vector of a linear transformation is a nonzero vector that changes at most by a scalar factor when that linear transformation is applied to it. The corresponding eigenvalue, often denoted by \lambda, is the factor by which the eigenvector is scaled. Geometrically, an eigenvector, corresponding to a real nonzero eigenvalue, points in a direction in which it is stretched by the transformation and the eigenvalue is the factor by which it is stretched. If the eigenvalue is negative, the direction is reversed. Loosely speaking, in a multidimensional vector space, the eigenvector is not rotated. Formal definition If is a linear transformation from a vector space over a field into itself and is a nonzero vector in , then is an eigenvector of if is a scalar multiple of . This can be written as T(\mathbf) = \lambda \mathbf, where is a scalar in , known as the eigenvalue, characteristic value, or characteristic root ass ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
