Kyoto University Research Information Repository
metadata only
ON CARTESIAN PRODUCTS OF GRAPHS AND THEIR COHERENT CONFIGURATIONS (Research on finite groups, algebraic combinatorics, and vertex algebras)
The coherent configuration WL(๐) of a graph ๐ is the smallest coherent configuration on the vertices of ๐ that contains the edge set of ๐ as a relation. We study WL(๐) when ๐ is a Cartesian product of graphs. The example of a Hamming graph shows that, in general, WL(๐) does not coincide with the ten
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source โ
Related documents
- ON CARTESIAN PRODUCTS OF GRAPHS AND THEIR COHERENT CONFIGURATIONS (Research on finite groups, algebraic combinatorics, and vertex algebras)#785321
- Orthogonal and unitary signings of cube-like graphs#1118892
- Common non-zero graphs of groups with few edges#1144257
- Does the notion of organizing only apply to pluralities? The origami, circle, and family hatter objections#92975
- Possible Patterns#764567
Record ยท ID 785352
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API ยท 20 free credits to start ยท no card required
Read the Docs โ ยท View CLI source on GitHub ยท Conceptio Open Knowledge Archive
Read the Docs โ ยท View CLI source on GitHub ยท Conceptio Open Knowledge Archive