3 papers
math.CO2026
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…
math.CO2025
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…
cs.DS2015
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…