Sum-connectivity index of a graph

作     者：Kinkar Ch. DAS Sumana DAS Bo ZHOU 

作者机构：Department of Mathematics Sungkyunkwan University Suwon 440-746 Korea School of Information and Communication Engineering Sungkyunkwan UniversitySuwon 440-746 Korea Department of Mathematics South China Normal University Guangzhou 510631 China 

出 版 物：《Frontiers of Mathematics in China》 (中国高等学校学术文摘·数学（英文）)

年 卷 期：2016年第11卷第1期

页      面：47-54页

核心收录：

学科分类：07[理学] 08[工学] 070104[理学-应用数学] 0813[工学-建筑学] 0814[工学-土木工程] 0701[理学-数学] 

基　　金：supported by the National Research Foundation funded by the Korean government 

主　　题：Graph Randid index sum-connectivity index minimum degree 

摘      要：Let G be a simple connected graph, and let di be the degree of its i-th vertex. The sure,connectivity index of the graph G is defined as χ（G） =∑vivj∈E（G）（di＋dj）-1/*** discuss the effect onχ（G）of inserting an edge into a graph. Moreover, we obtain the relations between sum-connectivity index and Randid index.