arXiv (All)
open access
On graphs with modularity zero or near-zero
It is known that complete graphs and complete multipartite graphs have modularity zero. We show that the least number of edges we may delete from the complete graph $K_n$ to obtain a graph with non-zero modularity is $\lfloor n/2\rfloor +1$. Similarly we determine the least number of edges we may de
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
- Cluster deletion and clique partitioning in graphs with bounded clique number#617822
- Cluster deletion and clique partitioning in graphs with bounded clique number#617322
- Modularity and community structure in networks#6478
- On the heat kernel of a Cayley graph of $\operatorname{PSL}_2\mathbb{Z}$#1141419
- Congruence Jumping in Polynomial Divisibility Systems: Arithmetic Structure and Solution Sets#1155743
Record · ID 971647
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