An improved upper bound for neighbor sum distinguishing edge colorings of graphs.
Xiaowei YuPublished in: Discret. Appl. Math. (2024)
Keyphrases
- upper bound
- weighted graph
- lower bound
- undirected graph
- worst case
- edge detection
- minimum spanning trees
- branch and bound algorithm
- lower and upper bounds
- linear functions
- directed graph
- graph coloring
- objective function
- vertex set
- nearest neighbor
- edge map
- branch and bound
- edge weights
- optimal solution
- bipartite graph
- graph matching
- graph theoretic
- graph clustering
- random graphs
- strongly connected
- absolute difference
- graph theory
- error probability