ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

On Triangular Sum Labeling of Graphs

Journal: GRD Journal for Engineering (Vol.3, No. 7)

Publication Date:

Authors : ;

Page : 29-33

Keywords : Triangular Numbers; Triangular Sum Labeling/Graphs; Dutch Windmill; Locally Finite Tree;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Let G = (V,E) be a (p, q)-graph. A graph G is said to admit a triangular sum labeling, if its vertices can be labeled by non-negative integers so that the values on the edges, obtained as the sum of the labels of their end vertices, are the first q triangular numbers. In this paper, we obtain a necessary condition for an eulerian graph to admit a triangular sum labeling and show that some classes of graphs admit a triangular sum labeling. Also we show that some classes of graphs can be embedded as an induced subgraph of a triangular sum graph. Citation: Shankaran P, NMAM Institute of Technology. "On Triangular Sum Labeling of Graphs." Global Research and Development Journal For Engineering 37 2018: 29 - 33.

Last modified: 2018-07-07 03:33:02