arXiv (All)
open access
Minimizing the spectral radius of unicyclic graphs with fixed order and dissociation number
A dissociation set of a graph G is a vertex subset S contained in V(G) such that the induced subgraph G[S] has maximum degree at most 1, and the dissociation number of G is the cardinality of a maximum dissociation set denoted by Φ(G). In this paper, we first derive a sharp lower bound on the dissoc
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
- An extremal theorem for non-isomorphic spanning trees#1078272
- Minimum Contagious Sets in Trees with Degree-Proportional Thresholds#1459268
- Normal approximation for subgraph counts in random intersection graphs: the case of edges#1412712
- An Approximate-Master-Equation Formulation of the Watts Threshold Model on Hypergraphs#1342311
- Equalising the Transmission Properties of Graph-Modelled Networks by Introducing the Control of the Resources Used to Transmit Information#203951
Record · ID 1489609
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