arXiv (All)
open access
On the Word-Representability of Tensor Product Graphs
Word-representable graphs are a class of graphs that can be represented by words, where edges and non-edges are determined by the alternation of letters in those words. The tensor product $G \times H$ (also known as the direct product or Kronecker product) is one of the four standard graph products.
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
- Matrix product operator algebras I: representations of weak Hopf algebras and projected entangled pair states#925012
- Matrix product operator algebras I: representations of weak Hopf algebras and projected entangled pair states#920778
- Tensor nuclear norm minimization with linear constraints#1117931
- Represented Tensor Products of Binary Matroids#1077156
- On Non-Existence of Absolutely Maximally Entangled Canonical Graph States in Even Local Dimensions#1129204
Record · ID 1034855
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