On the minimum Kirchhoff index of graphs with a given vertex k-partiteness and edge k-partiteness.
Weihua HeHao LiShuofa XiaoPublished in: Appl. Math. Comput. (2017)
Keyphrases
- undirected graph
- spanning tree
- minimum cost
- vertex set
- edge weights
- weighted graph
- directed graph
- minimum weight
- labeled graphs
- minimum spanning trees
- approximation algorithms
- random graphs
- strongly connected
- graph structure
- attributed graphs
- hamiltonian cycle
- minimum spanning tree
- shortest path
- database
- directed acyclic graph
- bipartite graph
- b tree
- complex networks
- edge information
- graph model
- connected components
- index structure
- maximum cardinality
- minimum length
- graph representation
- graph databases