• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs.

Yaser AlizadehSandi Klavzar
Published in: Appl. Math. Comput. (2018)
Keyphrases
  • graph matching
  • directed graph
  • graph mining
  • database
  • computational complexity
  • computational cost
  • graph theoretic
  • additive noise
  • data sets
  • database systems
  • markov random field
  • graph theory
  • graph databases