The group of an X-join of graphs

DOI10.1016/S0021-9800(68)80017-1zbMath0184.49002MaRDI QIDQ5576808

R. L. Hemminger

Publication date: 1968

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

automorphismspermutation groupadjacencylexicographic productvertex set

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) General theory for finite permutation groups (20B05)

Related Items (16)

SEIDEL SPECTRUM OF THE ZERO-DIVISOR GRAPH ON THE RING OF INTEGERS MODULO n ⋮ Generalized X-join of graphs and their automorphisms ⋮ Distinguishing threshold of graphs ⋮ Wreath product in automorphism groups of graphs ⋮ On the X-join decomposition for undirected graphs ⋮ Partitive hypergraphs ⋮ A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product ⋮ On unretractive graphs ⋮ On wreathed lexicographic products of graphs ⋮ Ü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) ⋮ Endomorphisms of graphs. I: The monoid of strong endomorphisms ⋮ On products of graphs and regular groups ⋮ Number of distinguishing colorings and partitions ⋮ Point determination in graphs

This page was built for publication: The group of an X-join of graphs