Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter.
Chunxiang WangJia-Bao LiuShaohui WangPublished in: Discret. Appl. Math. (2017)
Keyphrases
- bipartite graph
- upper bound
- lower bound
- maximum matching
- upper and lower bounds
- lower and upper bounds
- maximum cardinality
- worst case
- minimum weight
- branch and bound algorithm
- link prediction
- efficiently computable
- sample complexity
- branch and bound
- graph clustering
- maximum weight
- bipartite networks
- mutual reinforcement
- tight upper and lower bounds
- language model
- sufficient conditions
- stable set