On the public citation graph

Associative products of graphs

https://doi.org/10.1007/bf01472575
0 signed · 57 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01162967openalex-snapshot
Graph multiplication
inferredcites →https://doi.org/10.1007/bf01301004openalex-snapshot
Das lexikographische Produkt gerichteter Graphen
inferredcites →https://doi.org/10.1007/bf02029172openalex-snapshot
On the cancellation law among finite relational structures
inferredcites →https://doi.org/10.1016/0095-8956(71)90008-6openalex-snapshot
Über das schwache kartesische Produkt von Graphen
inferredcites →https://doi.org/10.1090/s0002-9939-1962-0133816-6openalex-snapshot
The Kronecker Product of Graphs
inferredcites →https://doi.org/10.21136/cpm.1958.108307openalex-snapshot
To the graph theory
inferredcites →https://doi.org/10.2307/1911908openalex-snapshot
The Theory of Graphs and Its Applications
inferredcites →https://doi.org/10.2307/2333777openalex-snapshot
The Theory of Graphs and its Applications.
inferredcites →https://doi.org/10.4064/cm-21-1-55-74openalex-snapshot
Weak cartesian product of graphs
inferredcites →https://doi.org/10.4064/fm-70-1-59-101openalex-snapshot
Cardinal multiplication of structures with a reflexive relation
inferredcites →https://doi.org/10.4153/cjm-1968-151-xopenalex-snapshot
The Categorical Product of Graphs
inferredcites →https://doi.org/10.7146/math.scand.a-10817openalex-snapshot
Boolean Operations on Graphs.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jctb.2001.2095openalex-snapshot
Products of Circulant Graphs Are Metacirculant
inferred← citeshttps://doi.org/10.1006/jctb.2001.2103openalex-snapshot
Families of Regular Graphs in Regular Maps
inferred← citeshttps://doi.org/10.1007/978-1-4613-0163-9_6openalex-snapshot
Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/bf02896459openalex-snapshot
On domination numbers of graph bundles
inferred← citeshttps://doi.org/10.1007/bfb0037431openalex-snapshot
Recognizing graph products and bundles
inferred← citeshttps://doi.org/10.1007/s00180-011-0228-6openalex-snapshot
Graphs as navigational infrastructure for high dimensional data spaces
inferred← citeshttps://doi.org/10.1007/s00373-014-1414-4openalex-snapshot
Generalized Wreath Products of Graphs and Groups
inferred← citeshttps://doi.org/10.1007/s10801-018-0814-6openalex-snapshot
Graphical Frobenius representations
inferred← citeshttps://doi.org/10.1007/s11432-014-5110-zopenalex-snapshot
The number of spanning trees in a new lexicographic product of graphs
inferred← citeshttps://doi.org/10.1007/s11786-012-0109-6openalex-snapshot
A Survey on Hypergraph Products
inferred← citeshttps://doi.org/10.1007/s11786-016-0276-yopenalex-snapshot
Associativity and Non-Associativity of Some Hypergraph Products
inferred← citeshttps://doi.org/10.1007/s40590-015-0081-7openalex-snapshot
Graph products and characterization by rings
inferred← citeshttps://doi.org/10.1007/s40840-024-01800-6openalex-snapshot
On Distance and Strong Metric Dimension of the Modular Product
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128152openalex-snapshot
On some metric properties of direct-co-direct product
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.07.001openalex-snapshot
Cartesian powers of graphs can be distinguished by two labels
inferred← citeshttps://doi.org/10.1016/j.endm.2014.08.008openalex-snapshot
Rings of Graphs
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2024.06.017openalex-snapshot
On an infinite family of integral Cayley graphs of Pauli groups
inferred← citeshttps://doi.org/10.1016/j.laa.2016.10.023openalex-snapshot
Wreath product of matrices
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00254-5openalex-snapshot
On recognizing Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00106-6openalex-snapshot
Unique square property and fundamental factorizations of graph bundles
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00048-7openalex-snapshot
A worthy family of semisymmetric graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00069-7openalex-snapshot
Factoring cardinal product graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00296-7openalex-snapshot
Algorithm for recognizing Cartesian graph bundles
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00022-4openalex-snapshot
Long cycles and long paths in the Kronecker product of a cycle and a tree
inferred← citeshttps://doi.org/10.1023/a:1022444205860openalex-snapshot
Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
inferred← citeshttps://doi.org/10.1080/16073606.1990.9631612openalex-snapshot
PRODUCTS OF CIRCULANT GRAPHS
inferred← citeshttps://doi.org/10.1093/comjnl/bxv084openalex-snapshot
Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two
inferred← citeshttps://doi.org/10.1109/icmsao.2017.7934923openalex-snapshot
A few properties of circulant graphs: Self-complementary, isomorphism, Cartesian product and factorization
inferred← citeshttps://doi.org/10.1109/pdcat.2007.20openalex-snapshot
The Edge Product of Networks
inferred← citeshttps://doi.org/10.1109/pdcat.2007.85openalex-snapshot
Pairwise Disjoint Paths in Pancake Graphs
inferred← citeshttps://doi.org/10.1155/2013/163740openalex-snapshot
A Theory of Cartesian Product and Factorization of Circulant Graphs
inferred← citeshttps://doi.org/10.1201/b10959-42openalex-snapshot
Near Products
inferred← citeshttps://doi.org/10.1201/b16132-37openalex-snapshot
Automorphisms
inferred← citeshttps://doi.org/10.12723/mjs.23.3openalex-snapshot
A Comparison on the Bounds of Chromatic Preserving Number and Dom-Chromatic Number of Cartesian Product and Kronecker Product of Paths
inferred← citeshttps://doi.org/10.1360/112010-1050openalex-snapshot
字典乘积网络的支撑树计数
inferred← citeshttps://doi.org/10.2174/0115701794281945240327053046openalex-snapshot
Omega Indices of Strong and Lexicographic Products of Graphs
inferred← citeshttps://doi.org/10.25046/aj020628openalex-snapshot
A Study on Isomorphic Properties of Circulant Graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.1117.7baopenalex-snapshot
Spectrum, distance spectrum, and Wiener index of wreath products of complete graphs
inferred← citeshttps://doi.org/10.30574/ijsra.2023.10.1.0848openalex-snapshot
An overview on graph products
inferred← citeshttps://doi.org/10.37236/8337openalex-snapshot
Permutational Powers of a Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1310.7085openalex-snapshot
Generalized wreath products of graphs and groups
inferred← citeshttps://doi.org/10.5860/choice.41-2860openalex-snapshot
Topics in graph automorphisms and reconstruction
inferred← citeshttps://doi.org/10.7151/dmgt.1023openalex-snapshot
Associative graph products and their independence, domination and coloring numbers
inferred← citeshttps://doi.org/10.7151/dmgt.1277openalex-snapshot
A Tandem version of the Cops and Robber Game played on products of graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.