Glossary Of Graph Theory
This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges. Symbols A B C D E F G H I K L M N O ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Ordered Pair
In mathematics, an ordered pair (''a'', ''b'') is a pair of objects. The order in which the objects appear in the pair is significant: the ordered pair (''a'', ''b'') is different from the ordered pair (''b'', ''a'') unless ''a'' = ''b''. (In contrast, the unordered pair equals the unordered pair .) Ordered pairs are also called 2tuples, or sequences (sometimes, lists in a computer science context) of length 2. Ordered pairs of scalars are sometimes called 2dimensional vectors. (Technically, this is an abuse of terminology since an ordered pair need not be an element of a vector space.) The entries of an ordered pair can be other ordered pairs, enabling the recursive definition of ordered ''n''tuples (ordered lists of ''n'' objects). For example, the ordered triple (''a'',''b'',''c'') can be defined as (''a'', (''b'',''c'')), i.e., as one pair nested in another. In the ordered pair (''a'', ''b''), the object ''a'' is called the ''first entry'', and the object ''b'' the '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Book Embedding
In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings into a ''book'', a collection of halfplanes all having the same line as their boundary. Usually, the vertices of the graph are required to lie on this boundary line, called the ''spine'', and the edges are required to stay within a single halfplane. The book thickness of a graph is the smallest possible number of halfplanes for any book embedding of the graph. Book thickness is also called pagenumber, stacknumber or fixed outerthickness. Book embeddings have also been used to define several other graph invariants including the pagewidth and book crossing number. Every graph with vertices has book thickness at most \lceil n/2\rceil, and this formula gives the exact book thickness for complete graphs. The graphs with book thickness one are the outerplanar graphs. The graphs with book thickness at most two are the subhamiltonian graphs, which are always planar; more generally, e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Book (graph Theory)
In graph theory, a book graph (often written B_p ) may be any of several kinds of graph formed by multiple cycles sharing an edge. Variations One kind, which may be called a quadrilateral book, consists of ''p'' quadrilaterals sharing a common edge (known as the "spine" or "base" of the book). That is, it is a Cartesian product of a star and a single edge. The 7page book graph of this type provides an example of a graph with no harmonious labeling. A second type, which might be called a triangular book, is the complete tripartite graph ''K''1,1,''p''. It is a graph consisting of p triangles sharing a common edge. A book of this type is a split graph. This graph has also been called a K_e(2,p) or a thagomizer graph (after thagomizers, the spiked tails of stegosaurian dinosaurs, because of their pointy appearance in certain drawings) and their graphic matroids have been called thagomizer matroids. Triangular books form one of the key building blocks of line perfect graph ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Block Graph
In graph theory, a branch of combinatorial mathematics, a block graph or clique tree. is a type of undirected graph in which every biconnected component (block) is a clique. Block graphs are sometimes erroneously called Husimi trees (after Kôdi Husimi), but that name more properly refers to cactus graphs, graphs in which every nontrivial biconnected component is a cycle. Block graphs may be characterized as the intersection graphs of the blocks of arbitrary undirected graphs.. Characterization Block graphs are exactly the graphs for which, for every four vertices , , , and , the largest two of the three distances , , and are always equal... They also have a forbidden graph characterization as the graphs that do not have the diamond graph or a cycle of four or more vertices as an induced subgraph; that is, they are the diamondfree chordal graphs. They are also the Ptolemaic graphs ( chordal distancehereditary graphs) in which every two nodes at distance two from each o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Biregular Graph
In graphtheoretic mathematics, a biregular graph or semiregular bipartite graph is a bipartite graph G=(U,V,E) for which every two vertices on the same side of the given bipartition have the same degree as each other. If the degree of the vertices in U is x and the degree of the vertices in V is y, then the graph is said to be (x,y)biregular. Example Every complete bipartite graph K_ is (b,a)biregular. The rhombic dodecahedron is another example; it is (3,4)biregular. Vertex counts An (x,y)biregular graph G=(U,V,E) must satisfy the equation x, U, =y, V, . This follows from a simple double counting argument: the number of endpoints of edges in U is x, U, , the number of endpoints of edges in V is y, V, , and each edge contributes the same amount (one) to both numbers. Symmetry Every regular bipartite graph is also biregular. Every edgetransitive graph (disallowing graphs with isolated vertices) that is not also vertextransitive must be biregular.. In particular every ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Bipartite Graph
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the ''parts'' of the graph. Equivalently, a bipartite graph is a graph that does not contain any oddlength cycles. The two sets U and V may be thought of as a coloring of the graph with two colors: if one colors all nodes in U blue, and all nodes in V red, each edge has endpoints of differing colors, as is required in the graph coloring problem.. In contrast, such a coloring is impossible in the case of a nonbipartite graph, such as a triangle: after one node is colored blue and another red, the third vertex of the triangle is connected to vertices of both colors, preventing it from being assigned either color. One often writes G=(U,V,E) to denote a bipartite graph whose partition has the parts U and V, with E denoting ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Biconnected Component
In graph theory, a biconnected component (sometimes known as a 2connected component) is a maximal biconnected subgraph. Any connected graph decomposes into a tree of biconnected components called the blockcut tree of the graph. The blocks are attached to each other at shared vertices called cut vertices or separating vertices or articulation points. Specifically, a cut vertex is any vertex whose removal increases the number of connected components. Algorithms Linear time depthfirst search The classic sequential algorithm for computing biconnected components in a connected undirected graph is due to John Hopcroft and Robert Tarjan (1973). It runs in linear time, and is based on depthfirst search. This algorithm is also outlined as Problem 222 of Introduction to Algorithms (both 2nd and 3rd editions). The idea is to run a depthfirst search while maintaining the following information: # the depth of each vertex in the depthfirstsearch tree (once it gets visited), an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Kvertexconnected Graph
In graph theory, a connected graph is said to be vertexconnected (or connected) if it has more than vertices and remains connected whenever fewer than vertices are removed. The vertexconnectivity, or just connectivity, of a graph is the largest for which the graph is vertexconnected. Definitions A graph (other than a complete graph) has connectivity ''k'' if ''k'' is the size of the smallest subset of vertices such that the graph becomes disconnected if you delete them. Complete graphs are not included in this version of the definition since they cannot be disconnected by deleting vertices. The complete graph with ''n'' vertices has connectivity ''n'' − 1, as implied by the first definition. An equivalent definition is that a graph with at least two vertices is ''k''connected if, for every pair of its vertices, it is possible to find ''k'' vertexindependent paths connecting these vertices; see Menger's theorem . This definition produces the same ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Complete Bipartite Graph
In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set..Electronic edition page 17. Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete bipartite graphs were already printed as early as 1669, in connection with an edition of the works of Ramon Llull edited by Athanasius Kircher. Llull himself had made similar drawings of complete graphs three centuries earlier.. Definition A complete bipartite graph is a graph whose vertices can be partitioned into two subsets and such that no edge has both endpoints in the same subset, and every possible edge that could connect vertices in different subsets is part of the graph. That is, it is a bipartite graph such that for every two vertices and, is an edge in . A complete bipartite graph with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Graph Bandwidth
In graph theory, the graph bandwidth problem is to label the vertices of a graph with distinct integers so that the quantity \max\ is minimized ( is the edge set of ). The problem may be visualized as placing the vertices of a graph at distinct integer points along the ''x''axis so that the length of the longest edge is minimized. Such placement is called linear graph arrangement, linear graph layout or linear graph placement. The weighted graph bandwidth problem is a generalization wherein the edges are assigned weights and the cost function to be minimized is \max\. In terms of matrices, the (unweighted) graph bandwidth is the minimal bandwidth of a symmetric matrix which is an adjacency matrix of the graph. The bandwidth may also be defined as one less than the maximum clique size in a proper interval supergraph of the given graph, chosen to minimize its clique size . Bandwidth formulas for some graphs For several families of graphs, the bandwidth \varphi(G) is give ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 

Graph Automorphism
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity. Formally, an automorphism of a graph is a permutation of the vertex set , such that the pair of vertices form an edge if and only if the pair also form an edge. That is, it is a graph isomorphism from to itself. Automorphisms may be defined in this way both for directed graphs and for undirected graphs. The composition of two automorphisms is another automorphism, and the set of automorphisms of a given graph, under the composition operation, forms a group, the automorphism group of the graph. In the opposite direction, by Frucht's theorem, all groups can be represented as the automorphism group of a connected graph – indeed, of a cubic graph. Computational complexity Constructing the automorphism group is at least as difficult (in terms of its computational complexity) as solving the graph ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] 