|
List Of Graphs
This partial list of Graph (discrete mathematics), graphs contains definitions of graphs and graph families which are known by particular names, but do not have a Wikipedia article of their own. For collected definitions of graph theory terms that do not refer to individual graph types, such as ''vertex'' and ''path'', see Glossary of graph theory. For links to existing articles about particular kinds of graphs, see :Graphs, Graphs. Gear A gear graph, denoted ''G''''n'' is a graph obtained by inserting an extra vertex between each pair of adjacent vertices on the perimeter of a wheel graph ''W''''n''. Thus, ''G''''n'' has 2''n''+1 vertices and 3''n'' edges. Gear graphs are examples of squaregraphs, and play a key role in the forbidden graph characterization of squaregraphs. Gear graphs are also known as cogwheels and bipartite wheels. Helm A helm graph, denoted ''Hn'' is a graph obtained by attaching a single edge and node to each node of the outer circuit of a wheel graph ''Wn' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gallery Of Named Graphs
Some of the finite structures considered in graph theory have names, sometimes inspired by the graph's topology, and sometimes after their discoverer. A famous example is the Petersen graph, a concrete graph on 10 vertices that appears as a minimal example or counterexample in many different contexts. Individual graphs File:Balaban 10-cage alternative drawing.svg, Balaban 10-cage File:Balaban 11-cage.svg, Balaban 11-cage File:Bidiakis cube.svg, Bidiakis cube File:Brinkmann graph LS.svg, Brinkmann graph File:Bull graph.circo.svg, Bull graph File:Butterfly graph.svg, Butterfly graph File:Chvatal graph.draw.svg, Chvátal graph File:Diamond graph.svg, Diamond graph File:Dürer graph.svg, Dürer graph File:Ellingham-Horton 54-graph.svg, Ellingham–Horton 54-graph File:Ellingham-Horton 78-graph.svg, Ellingham–Horton 78-graph File:Errera graph.svg, Errera graph File:Franklin graph.svg, Franklin graph File:Frucht planar Lombardi.svg, Frucht graph File:Goldner-Harary graph.svg, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gear Graph
This partial list of graphs contains definitions of graphs and graph families which are known by particular names, but do not have a Wikipedia article of their own. For collected definitions of graph theory terms that do not refer to individual graph types, such as ''vertex'' and ''path'', see Glossary of graph theory. For links to existing articles about particular kinds of graphs, see Graphs. Gear A gear graph, denoted ''G''''n'' is a graph obtained by inserting an extra vertex between each pair of adjacent vertices on the perimeter of a wheel graph ''W''''n''. Thus, ''G''''n'' has 2''n''+1 vertices and 3''n'' edges. Gear graphs are examples of squaregraphs, and play a key role in the forbidden graph characterization of squaregraphs. Gear graphs are also known as cogwheels and bipartite wheels. Helm A helm graph, denoted ''Hn'' is a graph obtained by attaching a single edge and node to each node of the outer circuit of a wheel graph ''Wn''. Lobster A lobster graph is a tree ... [...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] |
Path (graph Theory)
In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipathGraph Structure Theory: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, Held June 22 to July 5, 1991p.205/ref>) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See e.g. Bondy and Murty (1976), Gibbons (1985), or Diestel (2005). Korte et al. (1990) cover more advanced algorithmic topics concerning paths in graphs. Definitions Walk, trail, and path * A walk is a finite or infinite sequence of edges which joins a sequence of vertices. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prism (geometry)
In geometry, a prism is a polyhedron comprising an polygon Base (geometry), base, a second base which is a Translation (geometry), translated copy (rigidly moved without rotation) of the first, and other Face (geometry), faces, necessarily all parallelograms, joining corresponding sides of the two bases. All Cross section (geometry), cross-sections parallel to the bases are translations of the bases. Prisms are named after their bases, e.g. a prism with a pentagonal base is called a pentagonal prism. Prisms are a subclass of prismatoids. Like many basic geometric terms, the word ''prism'' () was first used in Euclid's Elements. Euclid defined the term in Book XI as “a solid figure contained by two opposite, equal and parallel planes, while the rest are parallelograms”. However, this definition has been criticized for not being specific enough in relation to the nature of the bases, which caused confusion among later geometry writers. Oblique prism An oblique prism is a pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cycle Graph
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if the graph is simple) connected in a closed chain. The cycle graph with vertices is called . The number of vertices in equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it. Terminology There are many synonyms for "cycle graph". These include simple cycle graph and cyclic graph, although the latter term is less often used, because it can also refer to graphs which are merely not acyclic. Among graph theorists, cycle, polygon, or ''n''-gon are also often used. The term ''n''-cycle is sometimes used in other settings. A cycle with an even number of vertices is called an even cycle; a cycle with an odd number of vertices is called an odd cycle. Properties A cycle graph is: * 2-edge colorable, if and only if it has an even number of vertices * 2-regular * 2-ve ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cube Graph
In graph theory, the hypercube graph is the graph formed from the vertices and edges of an -dimensional hypercube. For instance, the cube graph is the graph formed by the 8 vertices and 12 edges of a three-dimensional cube. has vertices, edges, and is a regular graph with edges touching each vertex. The hypercube graph may also be constructed by creating a vertex for each subset of an -element set, with two vertices adjacent when their subsets differ in a single element, or by creating a vertex for each -digit binary number, with two vertices adjacent when their binary representations differ in a single digit. It is the -fold Cartesian product of the two-vertex complete graph, and may be decomposed into two copies of connected to each other by a perfect matching. Hypercube graphs should not be confused with cubic graphs, which are graphs that have exactly three edges touching each vertex. The only hypercube graph that is a cubic graph is the cubical graph . Constru ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Caterpillar Tree
In graph theory, a caterpillar or caterpillar tree is a tree in which all the vertices are within distance 1 of a central path. Caterpillars were first studied in a series of papers by Harary and Schwenk. The name was suggested by Arthur Hobbs. As colorfully write, "A caterpillar is a tree which metamorphoses into a path when its cocoon of endpoints is removed.". Equivalent characterizations The following characterizations all describe the caterpillar trees: *They are the trees for which removing the leaves and incident edges produces a path graph. *They are the trees in which there exists a path that contains every vertex of degree two or more. *They are the trees in which every vertex of degree at least three has at most two non-leaf neighbors. *They are the trees that do not contain as a subgraph the graph formed by replacing every edge in the star graph ''K''1,3 by a path of length two. *They are the connected graphs that can be drawn with their vertices on two parallel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tree (graph Theory)
In 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 conne ..., a tree is an undirected graph in which any two Vertex (graph theory), vertices are connected by ''exactly one'' Path (graph theory), path, or equivalently a Connected graph, connected Cycle (graph theory), acyclic undirected graph. A forest is an undirected graph in which any two vertices are connected by ''at most one'' path, or equivalently an acyclic undirected graph, or equivalently a Disjoint union of graphs, disjoint union of trees. A polytreeSee . (or directed tree or oriented treeSee .See . or singly connected networkSee .) is a directed acyclic graph (DAG) whose underlying undirected graph is a tree. A polyforest (or directed forest or oriented forest) is a directed acyclic graph whose underlying undirecte ... [...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] |
SIAM Journal On Discrete Mathematics
'' SIAM Journal on Discrete Mathematics'' is a peer-reviewed mathematics journal published quarterly by the Society for Industrial and Applied Mathematics (SIAM). The journal includes articles on pure and applied discrete mathematics. It was established in 1988, along with the ''SIAM Journal on Matrix Analysis and Applications'', to replace the ''SIAM Journal on Algebraic and Discrete Methods''. The journal is indexed by ''Mathematical Reviews'' and Zentralblatt MATH. Its 2009 MCQ was 0.57. According to the ''Journal Citation Reports'', the journal has a 2016 impact factor of 0.755. Although its official ISO abbreviation is ''SIAM J. Discrete Math.'', its publisher and contributors frequently use the shorter abbreviation ''SIDMA''. References External links * Combinatorics journals Publications established in 1988 English-language journals Discrete Mathematics Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way ana ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
