2-BLOCK DUPLICATION OF PATH GRAPHS
Keywords:
AUM Block Duplication, ???? – block duplication, 2 – block duplication, path graph, neighborhood of a blockAbstract
In this paper, we present the 2 - block duplication of path graphs. In this process of 2 – block duplication, we use two distinct edges for duplicating the 2- blocks ???????? and ????????. The resulting graph is called the 2- block duplicated graph, denoted by ????????2(????????????????). The main focus is on path graphs and we present 2- block duplication on path graphs ????3, ????4 , ????5 , ????6 and ????????.











