A new upper bound for the total vertex irregularity strength of graphs.
Marcin AnholcerMaciej KalkowskiJakub PrzybyloPublished in: Discret. Math. (2009)
Keyphrases
- upper bound
- lower bound
- directed graph
- undirected graph
- labeled graphs
- hamiltonian cycle
- worst case
- attributed graphs
- branch and bound algorithm
- graph matching
- graph theoretic
- lower and upper bounds
- maximum cardinality
- branch and bound
- bipartite graph
- graph databases
- pattern recognition
- structured objects
- edge weights
- graph theory
- graph representation
- graph partitioning
- spanning tree
- fractal dimension
- complex structures
- graph clustering
- random graphs
- subgraph isomorphism
- series parallel
- minimum weight
- weighted graph
- combinatorial optimization
- error probability
- np hard