4 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…
On vertex peripherians and Wiener index of graphs with fixed number of cut vertices
Dinesh Pandey
The distance of a vertex in a graph is the sum of distances from that vertex to all other vertices of the graph. The Wiener index of a graph is the sum of distances between all its…