All Stories

  1. Maximising the number of connected induced subgraphs of unicyclic graphs
  2. Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs
  3. Bounding the $k$-Steiner Wiener and Wiener-Type Indices of Trees in Terms of Eccentric Sequence
  4. Cut and pendant vertices and the number of connected induced subgraphs of a graph
  5. Inducibility of d-ary trees
  6. The Minimum Asymptotic Density of Binary Caterpillars
  7. Inducibility of topological trees