Some inequalities for the atom-bond connectivity index of graph operations.
Gholam Hossein Fath-TabarB. Vaez-ZadehAli Reza AshrafiAnte GraovacPublished in: Discret. Appl. Math. (2011)
Keyphrases
- connected components
- planar graphs
- graph connectivity
- strongly connected
- graph representation
- random walk
- graph structure
- bit wise
- weighted graph
- binary images
- sufficient conditions
- graph databases
- topological information
- structured data
- index structure
- graph mining
- indexing method
- directed graph
- bit strings
- graph theory
- integer programming
- directed acyclic graph
- tree structure
- spanning tree
- bipartite graph
- minimum weight
- multi dimensional
- pairwise
- social networks
- search engine