arXiv (All)
open access
On the generalized cospectral mates of chain graphs of rank 4
A graph is called a chain graph if it is bipartite and the neighborhoods of the vertices in each color class are linearly ordered by inclusion. We study the generalized spectral determination of chain graphs of adjacency rank $4$. We first show that generalized cospectral chain graphs have the same
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
- Message Order Selects Opposite Collective Opinions on Laplacian-Cospectral Networks#659261
- Message Order Selects Opposite Collective Opinions on Laplacian-Cospectral Networks#657125
- Core-periphery identification in massive networks#819499
- Core-periphery identification in massive networks#809503
- Identifying maximal sets of significantly interacting nodes in higher-order networks#792586
Record · ID 1342762
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