Upper Bounds on the Diameter of Bipartite and Triangle-Free Graphs with Prescribed Edge Connectivity.
Blessings T. FundikwaJaya Percival MazorodzeSimon MukwembiPublished in: Int. J. Math. Math. Sci. (2020)
Keyphrases
- upper bound
- undirected graph
- weighted graph
- vertex set
- graph model
- connected components
- lower bound
- bipartite graph
- graph partitioning
- strongly connected
- directed graph
- edge weights
- average degree
- upper and lower bounds
- spanning tree
- branch and bound
- lower and upper bounds
- minimum spanning trees
- graph structure
- worst case
- approximation algorithms
- directed acyclic graph
- triangle mesh
- random graphs
- maximum distance
- graph theoretic
- edge detection
- branch and bound algorithm
- complex networks
- graph connectivity
- graph matching
- tight upper and lower bounds
- tight bounds
- graph databases
- minimum cost
- binary images
- topological properties
- sample complexity
- shortest path
- scheduling problem
- special case
- learning algorithm