• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >The Maximal ABC Index of the Corona of Two Graphs
【24h】

The Maximal ABC Index of the Corona of Two Graphs

机译：The Maximal ABC Index of the Corona of Two Graphs

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

Let G(1)omicron G(2) be the corona of two graphs G(1) and G(2) which is the graph obtained by taking one copy of G(1) and VG(1) copies of G(2) and then joining the ith vertex of G(1) to every vertex in the ith copy of G(2). The atom-bond connectivity index (ABC index) of a graph G is defined as ABCG= Sigma(uv is an element of E(G))root(d(G)u + d(G) (v) -2/d(G) (u)d(G) (v), where EG is the edge set of G and dGu and dGv are degrees of vertices u and v, respectively. For the ABC indices of G(1) omicron G(2) with G(1) and G(2) being connected graphs, we get the following results. (1) Let G(1) and G(2) be connected graphs. The ABC index of G(1) o G(2) attains the maximum value if and only if both G(1) and G(2) are complete graphs. If the ABC index of G(1) o G(2) attains the minimum value, then G(1) and G(2) must be trees. (2) Let T-1 and T-2 be trees. Then, the ABC index of T-1 o T-2 attains the maximum value if and only if (T)1 is a path and T-2 is a star.

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号