On the lower bound of the sum of the algebraic connectivity of a graph and its complement.
Mostafa EinollahzadehMohammad Mahdi KarkhaneeiPublished in: J. Comb. Theory, Ser. B (2021)
Keyphrases
- lower bound
- min sum
- upper bound
- objective function
- connected components
- graph connectivity
- random walk
- graph structure
- branch and bound
- strongly connected
- graph model
- directed graph
- branch and bound algorithm
- np hard
- optimal solution
- graph theory
- weighted graph
- worst case
- spanning tree
- lower and upper bounds
- topological information
- graph matching
- graph based algorithm
- sufficiently accurate
- graph partitioning
- graph theoretic
- edge weights
- lower bounding
- binary images