Paper Info
Title
The Zagreb indices of graphs with a given clique number
Abstract
For a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the degrees of vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. Let Wn,k be the set of connected n-vertex graphs with clique number k. In this work we characterize the graphs from Wn,k with extremal (maximal and minimal) Zagreb indices, and determine the values of corresponding indices.
Year
DOI
Venue
2011
10.1016/j.aml.2011.01.034
Applied Mathematics Letters
Keywords
Field
DocType
Zagreb index,Clique number,Chromatic number
Discrete mathematics,Clique number,Combinatorics,Vertex (geometry),Vertex (graph theory),Chordal graph,Clique-sum,Connectivity,Explained sum of squares,Clique (graph theory),Mathematics
Journal
Volume
Issue
ISSN
24
6
0893-9659
Citations 
PageRank 
References 
10
0.95
3
Authors
1
Name
Order
Citations
PageRank
Kexiang Xu17211.43