The composition of graphs

From MaRDI portal
Revision as of 10:46, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:773040

DOI10.1215/S0012-7094-59-02667-5zbMath0095.37802OpenAlexW2027284944WikidataQ100604505 ScholiaQ100604505MaRDI QIDQ773040

Gert Sabidussi

Publication date: 1959

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

Full work available at URL: https://doi.org/10.1215/s0012-7094-59-02667-5




Related Items (63)

Lexicographic polynomials of graphs and their spectraEntropy and the complexity of graphs: I. An index of the relative complexity of a graphEntropy and the complexity of graphs: II. The information content of digraphs and infinite graphsOperations on fuzzy graphsGeneralized intransitive dice. II: Partition constructionsQuantum automorphism group of the lexicographic product of finite regular graphsEdge-transitive productsThe isomorphism problem for Cayley digraphs on groups of prime-squared orderThe \(H\)-join of arbitrary families of graphs -- the universal adjacency spectrumSpectra and Laplacian spectra of arbitrary powers of lexicographic products of graphsThe distinguishing number and distinguishing index of the lexicographic product of two graphsEdge-transitive lexicographic and Cartesian productsWreath product of matricesDifferential geometry of group latticesCanonical double covers of circulantsGraph derivativesCanonical double covers of generalized Petersen graphs, and double generalized Petersen graphsWreath product in automorphism groups of graphsTetravalent \(s\)-transitive graphs of order \(4p ^{2}\)The spectra of graphs based on general graph operationsThe automorphism group of the wreath product of directed graphsOn groups all of whose Haar graphs are Cayley graphsLexicographic products with high reconstruction numbersThe monoid of strict endomorphisms of wreath productsCayley digraphs and lexicographic productResource placement in Cartesian product of networksCritically twin primitive 2-structuresEdge-transitive almost self-complementary graphsOn unretractive graphsOn unretractive graphsOn wreathed lexicographic products of graphsProduct graphs for given subgroups of the wreath product of two groups. IStructure of vertex-transitive graphsAutomorphisms of lexicographic productsDistance-balanced graphs: symmetry conditionsUnnamed ItemCounterexamples to two conjectures about distance sequencesOn automorphism groups of deleted wreath productsThe distinguishing number of the direct product and wreath product action.On isomorphisms of circulant digraphs of bounded degreeDistance matrices on the \textit{H-join} of graphs: a general result and applicationsUnnamed ItemOn automorphisms of direct products of Cayley graphs on abelian groupsThe automorphism group of a product of hypergraphsVertex-transitive graphsÜber das lexikographische Produkt von GraphenConnectivity of infinite graphs having a transitive torsion group actionOn the corona of two graphsÜber den Zusammenhang symmetrischer GraphenÜber die X-Summe von gerichteten GraphenAutomorphisms of $X$-sums of graphsOn the action of non-Abelian groups on 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Über den Zusammenhang von Graphen, mit Anwendung auf symmetrische GraphenTetravalent \(s\)-transitive graphs of order \(4p\)On automorphism groups of circulant digraphs of square-free orderPermutational powers of a graphThe structure of neighbor disconnected vertex transitive graphsProducts of circulant graphs are metacirculant.On automorphisms of circulant digraphs on \(p^{m}\) vertices, \(p\) an odd primeGeneralized wreath products of graphs and groupsOn almost self-complementary graphs







This page was built for publication: The composition of graphs