Upper bound on the diameter of a total domination vertex critical graph.
Michitaka FuruyaNaoya KatoPublished in: Ars Comb. (2016)
Keyphrases
- upper bound
- average degree
- lower bound
- directed graph
- undirected graph
- labeled graphs
- edge weights
- minimum weight
- random walk
- hamiltonian cycle
- graph theory
- graph representation
- weighted graph
- worst case
- vertex set
- constant factor
- branch and bound
- graph model
- graph structure
- branch and bound algorithm
- phase transition
- graph theoretic
- connected components
- attributed graphs
- strongly connected
- spanning tree
- structured data
- graph based algorithm
- maximum cardinality
- web graph
- directed acyclic graph
- np hard