An improved upper bound for the neighbor sum distinguishing index of graphs.
Guanghui WangGuiying YanPublished in: Discret. Appl. Math. (2014)
Keyphrases
- upper bound
- lower bound
- linear functions
- worst case
- branch and bound
- branch and bound algorithm
- objective function
- lower and upper bounds
- graph theoretic
- pruning power
- nearest neighbor
- weighted sum
- graph representation
- indexing method
- graph structure
- weighted graph
- graph mining
- graph model
- spanning tree
- bipartite graph
- index structure
- graph data
- random graphs
- query graph
- database