All Stories

  1. Workflow Scheduling With Guaranteed Responsiveness and Minimal Cost
  2. Partition and Colored Distances in Graphs Induced to Subsets of Vertices and Some of Its Applications
  3. Mathematical Aspects in Combining Network Coding With Transmission Range Adjustment
  4. Itinerary planning for mobile sinks in network-coding-based wireless sensor networks
  5. Partition distance in graphs
  6. A convex optimization model for topology control in network-coding-based-wireless-sensor networks
  7. On maximum Wiener index of trees and graphs with given radius
  8. Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs
  9. Relations between distance–based and degree–based topological indices
  10. Characterisation of forests with trivial game domination numbers
  11. Comparison between the Szeged index and the eccentric connectivity index
  12. Cut Method: Update on Recent Developments and Equivalence of Independent Approaches
  13. On the difference between the revised Szeged index and the Wiener index
  14. Improved bounds on the difference between the Szeged index and the Wiener index of graphs
  15. Computing distance moments on graphs with transitive Djoković–Winkler relation
  16. Wiener index in weighted graphs via unification ofΘ∗
  17. Cut method and Djoković-Winklerʼs relation
  18. Wiener index versus Szeged index in networks
  19. Relationship between edge Szeged and edge Wiener indices of graphs
  20. Graphs whose Szeged and Wiener numbers differ by 4 and 5
  21. On the power graph of a finite group
  22. On the differences between Szeged and Wiener indices of graphs
  23. Extremal graphs with respect to the vertex PI index