ladder graph
Смотреть что такое "ladder graph" в других словарях:
Möbius ladder — Two views of the Möbius ladder M16. In graph theory, the Möbius ladder Mn is a cubic circulant graph with an even number n of vertices, formed from an n cycle by adding edges (called rungs ) connecting opposite pairs of vertices in the cycle. It… … Wikipedia
cocktail party graph — noun a graph, consisting of two rows of paired nodes in which all nodes except the paired ones are connected with straight lines; it is the complement of the ladder graph, and the dual graph of the hypercube Syn: hyperoctahedral graph … Wiktionary
Schild's Ladder — Infobox Book | name = Schild s Ladder title orig = translator = image caption = author = Greg Egan illustrator = cover artist = country = Australia language = English series = genre = Science fiction publisher = pub date = 2002 english pub date … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected … Wikipedia
Circulant graph — The Paley graph of order 13, an example of a circulant graph. Crown graphs … Wikipedia
Loop (graph theory) — In graph theory, a loop (also called a self loop) is an edge that connects a vertex to itself. A simple graph contains no loops.Depending on the context, a graph or a multigraph may be defined so as to either allow or disallow the presence of… … Wikipedia
Toroidal graph — [ A graph (similar to the Heawood graph) embedded on the torus such that no edges cross. ] In mathematics, a graph G is toroidal if it can be embedded on the torus. In other words, the graph s vertices can be placed on a torus such that no edges… … Wikipedia
List of graphs — 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… … Wikipedia
Edge-graceful labeling — In graph theory, an edge graceful graph labeling is a type of graph labeling. This is a labeling for simple graphs , namely ones in which no two distinct edges connect the same two distinct vertices, no edge connects a vertex to itself, and the… … Wikipedia
Mario Strikers Charged Football — Entwickler Next Level Games Publisher … Deutsch Wikipedia
