Search results

Results 1 – 20 of 149
Advanced search

Search in namespaces:

There is a page named "Lexicographic product of graphs" on Wikipedia

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Thumbnail for Lexicographic product of graphs
    In graph theory, the lexicographic product or (graph) composition G ∙ H of graphs G and H is a graph such that the vertex set of G ∙ H is the cartesian...
    4 KB (419 words) - 07:48, 7 May 2024
  • mathematics, a lexicographical or lexicographic product may be formed of graphs – see lexicographic product of graphs orders – see lexicographical order This...
    259 bytes (53 words) - 20:34, 28 August 2016
  • Thumbnail for Graph (discrete mathematics)
    graphs, lexicographic product of graphs, series–parallel graphs. In a hypergraph, an edge can join any positive number of vertices. An undirected graph can...
    28 KB (3,689 words) - 00:52, 14 August 2024
  • graph theory, a graph product is a binary operation on graphs. Specifically, it is an operation that takes two graphs G1 and G2 and produces a graph H...
    7 KB (610 words) - 14:20, 28 August 2023
  • graphs), lexicographic graph product (or graph composition): it is an associative (for unlabelled graphs) and non-commutative operation, strong graph...
    5 KB (510 words) - 17:03, 16 August 2024
  • Thumbnail for Hedetniemi's conjecture
    contradiction. Since the tensor product of graphs is the category-theoretic product in the category of graphs (with graphs as objects and homomorphisms as...
    15 KB (1,853 words) - 23:35, 22 July 2024
  • Thumbnail for Product order
    extension of their product order, and thus the product order is a subrelation of the lexicographic order. The Cartesian product with the product order is the...
    5 KB (644 words) - 00:41, 28 April 2024
  • Thumbnail for Graph coloring
    signed graphs and gain graphs. Critical graph Graph coloring game Graph homomorphism Hajós construction Mathematics of Sudoku Multipartite graph Uniquely...
    67 KB (7,996 words) - 03:26, 15 August 2024
  • Twin-width (category Graph invariants)
    k-planar graphs. For the lexicographic product of graphs, the twin-width is exactly the maximum of the widths of the two factor graphs. Twin-width also behaves...
    33 KB (4,053 words) - 19:39, 29 July 2024
  • Thumbnail for Circle graph
    general graphs have polynomial time algorithms when restricted to circle graphs. For instance, Kloks (1996) showed that the treewidth of a circle graph can...
    15 KB (1,694 words) - 07:51, 18 July 2024
  • Ordered Key-Value Store (category Types of databases)
    pairs sorted by the key lexicographic order. OKVS systems provides different set of features and performance trade-offs. Most of them are shipped as a library...
    7 KB (789 words) - 18:20, 6 August 2024
  • the line graph, edge contraction, gluing two graphs in a clique of size 2 or more, tensor product, lexicographic product and strong product. Edge-deletion...
    30 KB (3,653 words) - 12:19, 12 August 2024
  • Thumbnail for Hoffman–Singleton graph
    while trying to classify all Moore graphs, and is the highest-order Moore graph known to exist. Since it is a Moore graph where each vertex has degree 7,...
    10 KB (1,371 words) - 05:00, 19 August 2024
  • Thumbnail for Clique problem
    Clique problem (category Computational problems in graph theory)
    another class of perfect graphs, the permutation graphs, a maximum clique is a longest decreasing subsequence of the permutation defining the graph and can...
    84 KB (9,905 words) - 11:45, 12 August 2024
  • (2000) Monoids, Acts and Categories with Applications to Wreath Products and Graphs, De Gruyter Expositions in Mathematics vol. 29, Walter de Gruyter...
    17 KB (2,834 words) - 15:11, 8 May 2024
  • Thumbnail for Hasse diagram
    Hasse diagram (redirect from Cover graph)
    MR 0818494 Thulasiraman, K.; Swamy, M. N. S. (1992), "5.7 Acyclic Directed Graphs", Graphs: Theory and Algorithms, John Wiley and Son, p. 118, ISBN 978-0-471-51356-8...
    11 KB (1,336 words) - 07:48, 18 July 2024
  • Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs, and divisor graphs. An incomparability...
    13 KB (1,383 words) - 01:41, 25 January 2024
  • Thumbnail for Partially ordered set
    Partially ordered set (category Pages displaying short descriptions of redirect targets via Module:Annotated link)
    order. As a classic example, the lexicographic order of totally ordered sets is a linear extension of their product order. Every partial order can be...
    40 KB (5,391 words) - 19:53, 22 June 2024
  • Thumbnail for De Bruijn sequence
    graph). An alternative construction involves concatenating together, in lexicographic order, all the Lyndon words whose length divides n. An inverse Burrows–Wheeler...
    32 KB (3,517 words) - 03:20, 25 March 2024
  • Total order (category Properties of binary relations)
    the product order, this relation also holds in the lexicographic order, and so on. All three can similarly be defined for the Cartesian product of more...
    21 KB (3,094 words) - 17:19, 9 April 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)