Associative products of graphs
From MaRDI portal
Publication:1226506
DOI10.1007/BF01472575zbMath0328.05136MaRDI QIDQ1226506
Wilfried Imrich, Herbert Izbicki
Publication date: 1975
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/177727
Related Items (24)
Algorithm for recognizing Cartesian graph bundles ⋮ The number of spanning trees in a new lexicographic product of graphs ⋮ Rings of graphs ⋮ Graphical Frobenius representations ⋮ Long cycles and long paths in the Kronecker product of a cycle and a tree ⋮ On domination numbers of graphs bundles ⋮ Cartesian powers of graphs can be distinguished by two labels ⋮ Associativity and non-associativity of some hypergraph products ⋮ Wreath product of matrices ⋮ On some metric properties of direct-co-direct product ⋮ Unnamed Item ⋮ Graph products and characterization by rings ⋮ A worthy family of semisymmetric graphs ⋮ A survey on hypergraph products ⋮ Unnamed Item ⋮ A theory of Cartesian product and factorization of circulant graphs ⋮ Graphs as navigational infrastructure for high dimensional data spaces ⋮ PRODUCTS OF CIRCULANT GRAPHS ⋮ Graphs S(n, k) and a Variant of the Tower of Hanoi Problem ⋮ Factoring cardinal product graphs in polynomial time ⋮ Permutational powers of a graph ⋮ Products of circulant graphs are metacirculant. ⋮ Families of regular graphs in regular maps ⋮ Generalized wreath products of graphs and groups
Cites Work
- Unnamed Item
- Unnamed Item
- Graph multiplication
- Über das schwache Kartesische Produkt von Graphen
- On the cancellation law among finite relational structures
- Das lexikographische Produkt gerichteter Graphen. (The lexicographic product of directed graphs)
- The Kronecker Product of Graphs
- Boolean Operations on Graphs.
- The Categorical Product of Graphs
- Weak cartesian product of graphs
- Cardinal multiplication of structures with a reflexive relation
This page was built for publication: Associative products of graphs