A divide-and-conquer bound for aggregate's quality and algebraic connectivity. Napov, A. Discrete Mathematics, 340(10):2355-2365, 2017.
A divide-and-conquer bound for aggregate's quality and algebraic connectivity. [link]Link  A divide-and-conquer bound for aggregate's quality and algebraic connectivity. [link]Paper  bibtex   
@article{journals/dm/Napov17,
  author = {Napov, Artem},
  ee = {https://doi.org/10.1016/j.disc.2017.05.003},
  interhash = {83f5279a345d852145830f6a090ccae2},
  intrahash = {cb8618b865f6730a9f8b2ade5b9d275e},
  journal = {Discrete Mathematics},
  number = 10,
  pages = {2355-2365},
  title = {A divide-and-conquer bound for aggregate's quality and algebraic connectivity.},
  url = {http://dblp.uni-trier.de/db/journals/dm/dm340.html#Napov17},
  volume = 340,
  year = 2017
}
Downloads: 0