arXiv (All)
open access
Nordhaus--Gaddum relations for degrees and connectivities under the $δ$-complement
The $δ$-complement $G_δ$ of a graph $G$ complements adjacency within each degree class and preserves adjacency between distinct degree classes. We establish sharp lower and upper additive and product Nordhaus--Gaddum bounds for the minimum degree, maximum degree, vertex connectivity, and edge connec
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
- Complementizers on edge#296694
- Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs#1141333
- Bounds for B-coloring planar and outerplanar graphs#818487
- Matching complements in subcubic graphs and a proof of the 3-Decomposition Conjecture#926194
- $(2,\mathcal{F})$-Avoiding Coloring and B-Coloring under Bipartite Exclusions#1144883
Record · ID 1014455
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