Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 18 min ago
PreprintCC BY 4.0arXiv

Sharp Bounds for Kulli-Basava Indices of Graphs

  • Sanju Vaidya
  • Jeff Chang
Open at sourcePDFDOICite

Abstract

In this paper, we establish formulas and sharp bounds for general Kulli-Basava indices and characterize graphs that attain these bounds. These indices have been shown to possess strong discriminating power for distinguishing nonisomorphic chemical structures. They are based on the edge neighborhood degrees of vertices in a graph. We also establish bounds for several classes of graphs, including triangle- and quadrangle-free graphs and graphs with a prescribed clique number. The formulas and bounds depend on the numbers of vertices and edges, the minimum and maximum edge neighborhood degrees, and the first Zagreb index.

Related

  1. Sharp Lovasz-Theta Bounds on Random Graphs
    Aaron Potechin, Jeff Xu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
    Ainesh Bakshi, Arpon Basu, Pravesh Kothari +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsQuantum physics & quantum informationarXiv
  3. Sharp Bounds on Torsional Rigidity of Metric Graphs with Signed Delta-Vertex Strengths
    Sedef Özcan
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  4. Sharp lower bounds for bisections of graphs with bounded maximum degree
    Qiwen Guo, Gregory Gutin
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Sharp Bounds for Edge Mappings of Graphs
    Zhanping Yang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{vaidya2026sharp,
  title = {{Sharp Bounds for Kulli-Basava Indices of Graphs}},
  author = {Sanju Vaidya and Jeff Chang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.28143},
  eprint = {2609.28143},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.28143},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Sharp Bounds for Kulli-Basava Indices of Graphs
AU  - Sanju Vaidya
AU  - Jeff Chang
PY  - 2026
DA  - 2026/09/23
PB  - arXiv
DO  - 10.48550/arxiv.2609.28143
UR  - https://arxiv.org/abs/2609.28143
AB  - In this paper, we establish formulas and sharp bounds for general Kulli-Basava indices and characterize graphs that attain these bounds. These indices have been shown to possess strong discriminating power for distinguishing nonisomorphic chemical structures. They are based on the edge neighborhood degrees of vertices in a graph. We also establish bounds for several classes of graphs, including triangle- and quadrangle-free graphs and graphs with a prescribed clique number. The formulas and bounds depend on the numbers of vertices and edges, the minimum and maximum edge neighborhood degrees, and the first Zagreb index.
ER  -