Kulli-Basava 指数的图的尖锐界
Sharp Bounds for Kulli-Basava Indices of Graphs
中文总结 AI 辅助
本文为广义 Kulli-Basava 指数建立公式与尖锐界，刻画达到界的图，并给出无三角形、无四边形及指定团数图类的界，这些指数基于边邻域度，可区分非同构化学结构。
中文摘要 AI 辅助
在本文中，我们建立了广义 Kulli-Basava 指数的公式和尖锐界，并刻画了达到这些界的图。这些指数已被证明在区分非同构化学结构方面具有强大的判别能力。它们基于图中顶点的边邻域度。我们还为几类图建立了界，包括无三角形和无四边形的图，以及具有指定团数的图。这些公式和界依赖于顶点数和边数、最小和最大边邻域度以及第一 Zagreb 指数。
英文摘要
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.
