On the sharp bounds of bicyclic graphs regarding edge Szeged index.
Yan YaoShengjin JiGuang LiPublished in: Appl. Math. Comput. (2020)
Keyphrases
- weighted graph
- upper bound
- undirected graph
- graph matching
- sharp edges
- lower bound
- edge detection
- error bounds
- high quality
- upper and lower bounds
- graph theoretic
- minimum spanning trees
- graph representation
- directed graph
- edge weights
- lower and upper bounds
- graph theory
- index structure
- worst case
- edge information
- edge map
- subgraph isomorphism
- indexing method
- high dimensional
- vertex set
- database
- worst case bounds
- vc dimension
- graph partitioning
- graph mining
- graph structure
- random walk
- level set