Contents

On the Cordiality of Elongated Plys

Samina Boxwala1, N. B. Limaye2
1Department of Mathematics, N. Wadia College, Pune,411001.
2Department of Mathematics, University of Mumbai, Vidyanagari, Mumbai 400098, INDIA

Abstract

An elongated ply \( T(n; t^{(1)}, t^{(2)}, \ldots, t^{(n)}) \) is a snake of \( n \) number of plys \( P_{t(i)} (u_i, u_{i+1}) \) where any two adjacent plys \( P_{t(i)} \) and \( P_{t(i+1)} \) have only the vertex \( u_{i+1} \) in common. That means the block cut vertex graph of \( T_n \) is thus a path of length \( n – 1 \). In this paper, the cordiality of the Elongated Ply \( T_n \) is investigated.