Browsing by Author "Pal, Anita"

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path
    (Ankara Üniversitesi Fen Fakültesi, 2019-08-01) Ghosy, Sumonta; Pal, Anita; Other; Other
    Cordial labeling is one of the useful labeling in the realm of graph labeling. For the graph G=(V,E) vertex set V is label by {0,1}, where labeling of edge set E calculated by absolute difference between the end vertices labeling with the restriction that number of vertices label by 0 and number of vertices label by 1, their absolute difference not exceeding 1. If similar restriction will follow for edge also then the labeling technique is known as cordial labeling and the graph which admits cordial labeling is known as cordial graph. In this paper we want to apply cordial labeling on a complex graph structure which we obtained by Cartesian product between complete bipartite graph(Balanced bipartite graph) K_{n,n} and path P_{r}. We also propose three algorithm to label the above said graph by cordial labeling. We have analyse the time complexity of each algorithm and which is super-linear.
  • No Thumbnail Available
    Item
    The M-polynomial of line graph of subdivision graphs
    (Ankara Üniversitesi Fen Fakültesi, 2019-08-01) Mondal, Sourav; De, Nilanjan; Pal, Anita; Other; Other
    Three composite graphs Ladder graph (L_{n}), Tadpole graph (T_{n,k}) and Wheel graph (W_{n}) are graceful graphs, which have different applications in electrical, electronics, wireless communication etc. In this report, we first determine M-polynomial of the Line graph of those three graphs using subdivision idea and then compute some degree based indices of the same.