6 citations · 27 across the 12 of their papers we have counts for
4 papers · 1 filter
L(2,1)-labelling of Circular-arc Graph
Satyabrata Paul, Madhumangal Pal, Anita Pal
An L(2,1)-labelling of a graph is a function from the vertex set V (G) to the set of non-negative integers such that adjacent vertices get numbers at le…
Connective eccentric index of some graph operations
Nilanjan De, Anita Pal, Sk. Md. Abu Nayeem
The connective eccentric index of a graph is a topological index involving degrees and eccentricities of vertices of the graph. In this paper, we have studied the connective eccent…
Scheduling algorithm to select optimal programme slots in television channels: A graph theoretic approach
Madhumangal Pal, Anita Pal
In this paper, it is shown that all programmes of all television channels can be modelled as an interval graph. The programme slots are taken as the vertices of the graph and if th…
Bounds for the modified eccentric connectivity index
Nilanjan De, Sk. Md. Abu Nayeem, Anita Pal
The modified eccentric connectivity index of a graph is defined as the sum of the products of eccentricity with the total degree of neighboring vertices, over all vertices of the g…