arXiv (All)
open access
Connected graphs with equal independence number and radius
A classical theorem states that the independence number of any connected graph is at least its radius. In 2007, DeLaViña, Pepper, and Waller proved that every connected graph with equal independence number and radius is traceable. We first give a new short proof of this theorem and then prove two re
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
- Independence number, essential connectivity and the distance spectral radius of graphs#1142283
- Multiplicative Path Weights in Networks: From Katz Connectivity to Mean First-Passage Times#1356810
- Perron-Wright asymptotics and critical component processes for regular inhomogeneous random graphs#1387292
- Social Multi-dependence Scale: Measuring Diversification of Dependence on Others#355542
- The average distance and the independence number#490251
Record · ID 1422957
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