arXiv (All)
open access
A Unified Linear Programming Approach for Maximizing Vertex-Degree-Based Indices of Trees
The problem of maximizing vertex-degree-based topological indices over trees with a prescribed order and maximum degree $Δ$ has traditionally relied on ad-hoc combinatorial arguments. In this paper, we establish a unified linear programming approach that systematically resolves these extremal proble
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
- Identifying open codes in trees and 4-cycle-free graphs of given maximum degree#1186299
- Graph theory with applications to engineering and computer science#1332055
- Odd Cycle Transversal on $H$-free graphs#1105459
- A Sublinear Minimum-Degree Condition for $2$-Connected Subgraphs of All Orders#793866
- A Sublinear Minimum-Degree Condition for $2$-Connected Subgraphs of All Orders#789847
Record · ID 1355290
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