arXiv (All)
open access
The polynomial characterization of tope graphs of the lopsided sets
The cube polynomial $C_G(x)$ generates the number of $k$-cubes on a graph $G$. As a subclass of partial cubes, the tope graphs of lopsided sets (LOPs) generalize daisy cubes and median graphs. In this paper, we prove that every tope graph of a LOP shares its cube polynomial with some daisy cube, the
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 Alon's problem concerning the difference between connected domination number and domination number#1077551
- On Unavoidable Faces of High-Dimensional Polytopes#819846
- On Unavoidable Faces of High-Dimensional Polytopes#809850
- Ramsey Theory for Product Trees#1076554
- Independent domination polynomials of binary sequence graphs#418048
Record · ID 1037424
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