|
Graph Drawing
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graph (discrete mathematics), graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics. A drawing of a graph or network diagram is a pictorial representation of the vertex (graph theory), vertices and edge (graph theory), edges of a graph. This drawing should not be confused with the graph itself: very different layouts can correspond to the same graph., p. 6. In the abstract, all that matters is which pairs of vertices are connected by edges. In the concrete, however, the arrangement of these vertices and edges within a drawing affects its understandability, usability, fabrication cost, and aesthetics. The problem gets worse if the graph changes over time by adding and deleting edges (dynamic graph drawing) and the goal is to preserve the user's menta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ramon Llull
Ramon Llull (; c. 1232 – c. 1315/16) was a philosopher, theologian, poet, missionary, and Christian apologist from the Kingdom of Majorca. He invented a philosophical system known as the ''Art'', conceived as a type of universal logic to prove the truth of Christian doctrine to interlocutors of all faiths and nationalities. The ''Art'' consists of a set of general principles and combinatorial operations. It is illustrated with diagrams. A prolific writer, he is also known for his literary works written in Catalan, which he composed to make his ''Art'' accessible to a wider audience. In addition to Catalan and Latin he also probably wrote in Arabic (although no texts in Arabic survive). His books were translated into Occitan, French, and Castilian during his lifetime. Although his work did not enjoy huge success during his lifetime, he has had a rich and continuing reception. In the early modern period his name became associated with alchemical works. More recently he has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Embedding
In topological graph theory, an embedding (also spelled imbedding) of a Graph (discrete mathematics), graph G on a surface (mathematics), surface \Sigma is a representation of G on \Sigma in which points of \Sigma are associated with graph theory, vertices and simple arcs (Homeomorphism, homeomorphic images of [0,1]) are associated with graph theory, edges in such a way that: * the endpoints of the arc associated with an edge e are the points associated with the end vertices of e, * no arcs include points associated with other vertices, * two arcs never intersect at a point which is interior to either of the arcs. Here a surface is a compact space, compact, connected space, connected 2-manifold. Informally, an embedding of a graph into a surface is a drawing of the graph on the surface in such a way that its edges may intersect only at their endpoints. It is well known that any finite graph can be embedded in 3-dimensional Euclidean space \mathbb^3.. A planar graph is one that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Planar Graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points. Every graph that can be drawn on a plane can be drawn on the sphere as well, and vice versa, by means of stereographic projection. Plane graphs can be encoded by combinatorial maps or rotation systems. An equivalence class of topologically equivalent drawings on the sphere, usually with additional assumptions such as the absence of isthmuses, is called a pl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Crossing Number (graph Theory)
In graph theory, the crossing number of a graph is the lowest number of edge crossings of a plane drawing of the graph . For instance, a graph is planar if and only if its crossing number is zero. Determining the crossing number continues to be of great importance in graph drawing, as user studies have shown that drawing graphs with few crossings makes it easier for people to understand the drawing. The study of crossing numbers originated in Turán's brick factory problem, in which Pál Turán asked for a factory plan that minimized the number of crossings between tracks connecting brick kilns to storage sites. Mathematically, this problem can be formalized as asking for the crossing number of a complete bipartite graph. The same problem arose independently in sociology at approximately the same time, in connection with the construction of sociograms. Turán's conjectured formula for the crossing numbers of complete bipartite graphs remains unproven, as does an analogous formu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adjacency Matrix
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph. In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected (i.e. all of its edges are bidirectional), the adjacency matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory. The adjacency matrix of a graph should be distinguished from its incidence matrix, a different matrix representation whose elements indicate whether vertex–edge pairs are incident or not, and its degree matrix, which contains information about the degree of each vertex. Definition For a simple graph with vertex set , the adjacency matrix is a square matrix such that its element is one when there is an edge from vertex to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Train Track (mathematics)
In the mathematical area of topology, a train track is a family of curves embedded on a surface, meeting the following conditions: #The curves meet at a finite set of vertices called ''switches''. #Away from the switches, the curves are smooth and do not touch each other. #At each switch, three curves meet with the same tangent line, with two curves entering from one direction and one from the other. The main application of train tracks in mathematics is to study laminations of surfaces, that is, partitions of closed subsets of surfaces into unions of smooth curves. Train tracks have also been used in graph drawing. Train tracks and laminations A lamination of a surface is a partition of a closed subset of the surface into smooth curves. The study of train tracks was originally motivated by the following observation: If a generic lamination on a surface is looked at from a distance by a myopic person, it will look like a train track. A switch in a train track models a point wh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Intersection Graph
In graph theory, an intersection graph is a graph that represents the pattern of intersections of a family of sets. Any graph can be represented as an intersection graph, but some important special classes of graphs can be defined by the types of sets that are used to form an intersection representation of them. Formal definition Formally, an intersection graph is an undirected graph formed from a family of sets : S_i, \,\,\, i = 0, 1, 2, \dots by creating one vertex for each set , and connecting two vertices and by an edge whenever the corresponding two sets have a nonempty intersection, that is, : E(G) = \. All graphs are intersection graphs Any undirected graph may be represented as an intersection graph. For each vertex of , form a set consisting of the edges incident to ; then two such sets have a nonempty intersection if and only if the corresponding vertices share an edge. Therefore, is the intersection graph of the sets . provide a construction that is more ef ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circle Packing Theorem
The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose interiors are disjoint. A circle packing is a connected collection of circles (in general, on any Riemann surface) whose interiors are disjoint. The intersection graph of a circle packing is the graph having a vertex for each circle, and an edge for every pair of circles that are tangent. If the circle packing is on the plane, or, equivalently, on the sphere, then its intersection graph is called a coin graph; more generally, intersection graphs of interior-disjoint geometric objects are called tangency graphs or contact graphs. Coin graphs are always connected, simple, and planar. The circle packing theorem states that these are the only requirements for a graph to be a coin graph: Circle packing theorem: For every connected simple planar graph ''G'' there is a circle packing in the plane whose intersection graph is (isom ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Upward Planar Drawing
In graph drawing, an upward planar drawing of a directed acyclic graph is an embedding of the graph into the Euclidean plane, in which the edges are represented as non-crossing monotonic upwards curves. That is, the curve representing each edge should have the property that every horizontal line intersects it in at most one point, and no two edges may intersect except at a shared endpoint. In this sense, it is the ideal case for layered graph drawing, a style of graph drawing in which edges are monotonic curves that may cross, but in which crossings are to be minimized. Characterizations A directed acyclic graph must be planar in order to have an upward planar drawing, but not every planar acyclic graph has such a drawing. Among the planar directed acyclic graphs with a single source (vertex with no incoming edges) and sink (vertex with no outgoing edges), the graphs with upward planar drawings are the ''st''-planar graphs, planar graphs in which the source and sink both belong ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orientability
In mathematics, orientability is a property of some topological spaces such as real vector spaces, Euclidean spaces, surfaces, and more generally manifolds that allows a consistent definition of "clockwise" and "counterclockwise". A space is orientable if such a consistent definition exists. In this case, there are two possible definitions, and a choice between them is an orientation of the space. Real vector spaces, Euclidean spaces, and spheres are orientable. A space is non-orientable if "clockwise" is changed into "counterclockwise" after running through some loops in it, and coming back to the starting point. This means that a geometric shape, such as , that moves continuously along such a loop is changed into its own mirror image . A Möbius strip is an example of a non-orientable space. Various equivalent formulations of orientability can be given, depending on the desired application and level of generality. Formulations applicable to general topological manifolds o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
