arXiv (All)
open access
Independence number, essential connectivity and the distance spectral radius of graphs
An independent set of a graph G is a subset of VG, no two of which are adjacent. The cardinality of a maximum independent set in a graph G is called the independence number of G, denoted by alpha(G). The essential connectivity kappa'(G) of a graph G is denoted as the minimum number of vertices of G
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
- The average distance and the independence number#490251
- Absolute indices for determining compactness, separability and number of clusters#677437
- Absolute indices for determining compactness, separability and number of clusters#674240
- Explanatory independence and epistemic interdependence: A case study of the optimality approach#761466
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving#985566
Record · ID 1142283
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