Search results

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...

mathematics, a lexicographical or lexicographic product may be formed of graphs – see lexicographic product of graphs orders – see lexicographical order This...

graphs, lexicographic product of graphs, series–parallel graphs. In a hypergraph, an edge can join any positive number of vertices. An undirected graph can...

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...

graphs), lexicographic graph product (or graph composition): it is an associative (for unlabelled graphs) and non-commutative operation, strong graph...

contradiction. Since the tensor product of graphs is the category-theoretic product in the category of graphs (with graphs as objects and homomorphisms as...

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...

signed graphs and gain graphs. Critical graph Graph coloring game Graph homomorphism Hajós construction Mathematics of Sudoku Multipartite graph Uniquely...

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...

general graphs have polynomial time algorithms when restricted to circle graphs. For instance, Kloks (1996) showed that the treewidth of a circle graph can...

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...

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...

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,...

another class of perfect graphs, the permutation graphs, a maximum clique is a longest decreasing subsequence of the permutation defining the graph and can...

(2000) Monoids, Acts and Categories with Applications to Wreath Products and Graphs, De Gruyter Expositions in Mathematics vol. 29, Walter de Gruyter...

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...

Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs, and divisor graphs. An incomparability...

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...

graph). An alternative construction involves concatenating together, in lexicographic order, all the Lyndon words whose length divides n. An inverse Burrows–Wheeler...

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...