5 papers
On a conjecture of DeLaViña and Waller
Dinesh Pandey, Peruvemba Sundaram Ravi
The Wiener index of a connected graph is defined as the sum of distances between all its unordered pairs of vertices. Characterising graphs on vertices with a fixed diameter th…
On structural properties of some probable -critical graphs
Dinesh Pandey, Peruvemba Sundaram Ravi
The Ramsey number is the smallest positive integer such that every graph on vertices contains either a clique of size or an independent set of size . An $R…
Extremal graphs with minimum number of connected subgraphs in a given family
Dinesh Pandey, Peruvemba Sundaram Ravi
The subgraph number of a vertex in a graph is defined as the number of connected subgraphs containing that vertex. The graph and its vertex which correspond to the minimum subgraph…
Approximation Ratio of LD Algorithm for Multi-Processor Scheduling and the Coffman-Sethi Conjecture
Peruvemba Sundaram Ravi, Levent Tuncel
Coffman and Sethi proposed a heuristic algorithm, called LD, for multi-processor scheduling, to minimize makespan over flowtime-optimal schedules. LD algorithm is a natural extensi…
Worst-Case Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and Flow-Time
Peruvemba Sundaram Ravi, Levent Tuncel, Michael Huang
In 1976, Coffman and Sethi conjectured that a natural extension of LPT list scheduling to the bicriteria scheduling problem of minimizing makespan over flowtime optimal schedules,…