Strict lower bounds on the multiplicative Zagreb indices of graph operations.
Farzaneh Falahati NezhadAli IranmaneshAbolfazl TehranianMahdieh AzariPublished in: Ars Comb. (2014)
Keyphrases
- lower bound
- upper bound
- min sum
- graph theory
- branch and bound algorithm
- graph representation
- graph structure
- graph based algorithm
- np hard
- random walk
- branch and bound
- connected components
- directed graph
- vc dimension
- graph matching
- graph theoretic
- constant factor
- graph partitioning
- graph model
- weighted graph
- structured data
- graphical models
- sample complexity
- objective function
- lower and upper bounds
- search algorithm
- optimal solution