arXiv (All)
open access
On nut graphs with two vertex and three edge orbits
Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified a
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
- Perfect matchings and $A_α$-spectral radius in 1-binding graphs#1062893
- Do $K_{3,3}$-Free Latin Squares Exist?#984787
- Bergman's amalgamation problem over the circle#1064364
- A generalized Saito criterion, from line arrangements to curves#1077751
- Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers#384963
Record · ID 1076743
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