Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges |
| |
| Authors: | Shubo Chen Weijun Liu |
| |
| Institution: | 1. College of Mathematics, Hunan City University, Yiyang, 413000, People’s Republic of China
2. College of Mathematics and Statistics, Central South University, Changsha, 410075, People’s Republic of China
|
| |
| Abstract: | For a graph, the first Zagreb index M 1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M 2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. Denote by ${\mathcal{G}_{n,k}}$ the set of graphs with n vertices and k cut edges. In this paper, we showed the types of graphs with the largest and the second largest M 1 and M 2 among ${\mathcal{G}_{n,k}}$ . |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
