arXiv (All)
open access
On the weight distribution bound for the negative eigenvalue of polar collinearity graphs
The weight distribution bound gives a lower bound on the weight of eigenvectors for eigenvalues of distance-regular graphs. In this note, we study when the weight distribution bound is tight for the negative eigenvalue of collinearity graphs of finite embedded polar spaces, and elliptic and hyperbol
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
- SPR: Toward a Graph Foundation Model for Transferable Graph Cognition via Spectral Patterns and Relational Geometry#1116314
- Scaled Relative Graphs in Normed Spaces#1050854
- Two short proofs of incompatibility for correlation matrices#1084552
- Topology-Adaptive Hyperbolic Graph Attention Networks Guided by the Hyperbolic Sombor Index#1116606
- Hyperbolic Graph Representation Learning: Embed in One Metric, Optimize with Another#1215831
Record · ID 1399938
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