The lexicographic product of graphs

DOI10.1215/S0012-7094-61-02857-5zbMath0115.41102WikidataQ100604481 ScholiaQ100604481MaRDI QIDQ5925127

Gert Sabidussi

Publication date: 1961

Published in: Duke Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items (24)

Operations on fuzzy graphs ⋮ Generalized intransitive dice. II: Partition constructions ⋮ Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries ⋮ On certain polytopes associated with graphs ⋮ Generalized X-join of graphs and their automorphisms ⋮ Wreath product in automorphism groups of graphs ⋮ Decomposition tree of a lexicographic product of binary structures ⋮ The automorphism group of the wreath product of directed graphs ⋮ Lexicographic products with high reconstruction numbers ⋮ The monoid of strict endomorphisms of wreath products ⋮ Edge-transitive strips ⋮ A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product ⋮ Automorphisms of lexicographic products ⋮ Bicirculants via imprimitivity block systems ⋮ Infinite families of directed strongly regular graphs using equitable partitions ⋮ The automorphism group of a product of hypergraphs ⋮ Vertex-transitive graphs ⋮ Über das lexikographische Produkt von Graphen ⋮ Über die X-Summe von gerichteten Graphen ⋮ Automorphisms of $X$-sums of graphs ⋮ Über das lexikographische und das kostarke Produkt von Mengensystemen. (On the lexicographic and the costrong product of set systems) ⋮ Number of distinguishing colorings and partitions ⋮ Generalized symmetry of graphs - a survey ⋮ Transitive permutation groups of prime-squared degree

This page was built for publication: The lexicographic product of graphs