On the minimum Kirchhoff index of graphs with a fixed number of cut vertices.
Ashkan NiksereshtPublished in: Discret. Appl. Math. (2016)
Keyphrases
- fixed number
- weighted graph
- planar graphs
- minimum cut
- vertex set
- query graph
- undirected graph
- labeled graphs
- spanning tree
- random graphs
- adjacency matrix
- partial ordering
- graph partitioning
- attributed graphs
- edge weights
- graph matching
- hamiltonian cycle
- minimum cost
- directed edges
- maximal cliques
- minimum weight
- graph representation
- graph clustering
- graph theoretic
- graph databases
- graph model
- finite number
- subgraph isomorphism
- maximum flow
- graph theory
- maximum cardinality
- identical parallel machines
- graph data
- average degree
- lower bound
- bipartite graph
- directed graph
- monte carlo
- shortest path
- special case