2 citations · 2 across the 5 of their papers we have counts for
6 papers · 1 filter
Some new central parts of connected graphs
Dinesh Pandey, Kamal Lochan Patra
The center, median and the security center are three central parts defined for any connected graph whereas the characteristic set, subtree core and core vertices are three central…
Total eccentricity index of graphs with fixed number of pendant or cut vertices
Dinesh Pandey, Kamal Lochan Patra
The total eccentricity index of a connected graph is defined as sum of the eccentricities of all its vertices. We denote the set of all connected graphs on vertices with pe…
A conjecture on different central parts of binary trees
Dinesh Pandey, Kamal Lochan Patra
Let be the family of binary trees on vertices obtained by identifying the root of an rgood binary tree with a vertex of maximum eccentricity of a binary caterpillar. In t…
Different central parts of trees and their pairwise distances
Dinesh Pandey, Kamal Lochan Patra
We determine the tree which maximizes the distance between characteristic set and subtree core over all trees on vertices. The asymptotic nature of this distance is also discus…
Wiener index of graphs with fixed number of pendant or cut vertices
Dinesh Pandey, Kamal Lochan Patra
The Wiener index of a connected graph is defined as the sum of the distances between all unordered pair of its vertices. In this paper, we characterize the graphs which extremize t…
The core index of a graph
Dinesh Pandey, Kamal Lochan Patra
For a graph we denote the number of connected subgraphs of by . For a tree , has been studied extensively and it has been observed that has a revers…