2-BLOCK DUPLICATION OF PATH GRAPHS

Authors

  • A. Uma Maheswari
  • E. Praveena
  • C. Ambika
  • V. Sumathi

Keywords:

AUM Block Duplication, ???? – block duplication, 2 – block duplication, path graph, neighborhood of a block

Abstract

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 ????????.

Downloads

Published

2025-06-16

How to Cite

A. Uma Maheswari, E. Praveena, C. Ambika, & V. Sumathi. (2025). 2-BLOCK DUPLICATION OF PATH GRAPHS. Utilitas Mathematica, 122(1), 970–984. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/2265

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.