A Comparative Analysis on Several Crucial Benefits Upon Triangular Sum Graphs

Hedge and Shankaran present triangular sum labeling notion, they state that a chart _ is stated to affirm a triangular sum labeling, in the event that its vertices might be marked by nonnegative whole numbers so the qualities on the edges, acquired as the entirety of the names of their closure vertices, are the first _ triangular numbers. They give an essential condition for an Eulerian diagram to affirm a triangular sum labeling, they indicate that certain groups of diagrams affirm a triangular total marking, and they guess that each tree allows a triangular sum labeling. Likewise they indicate that certain groups of charts could be installed as instigated subgraphs of triangular sum graphs. At last they close stating "as each chart can't be implanted as an affected subgraph of a triangular sum graphs, it is intriguing to implant groups of GRAPHS as an affected subgraph of a triangular sum graphs ". We demonstrate that each tree might be inserted as an affected subgraph of a triangular sum graphs, additionally we demonstrate that each cycle might be inserted as an affected subgraph of a triangular sum graphs giving some identified outcomes. We name certain groups of triangular sum graphs, and demonstrate that certain families might be inserted as an instigated subgraphs of triangular sum graphs. We start with basic, limited, associated, undirected and non-inconsequential chart G = (V,E), where V is called the situated of vertices and E is called the set of edges. For different chart theoretic documentations and terminology we accompany Horrible and Yellen and for number speculation we accompany Burton. We will give short summery of definitions which are helpful for the present examinations. Definition : If the vertices of the graph are doled out qualities, subject to certain conditions is reputed to be chart naming. For portion overview on graph naming one can point Gallian . Immense measure of expositive expression is accessible on distinctive sorts of diagram marking and more than 1000 examination papers have been produced so far in most recent four decades. Most enthralling marking issues have three essential fixings. • a set of numbers from which vertex marks are picked. • a decide that relegates a worth to every edge. • a condition that the aforementioned qualities should fulfill. The present work is expected to examine one such marking regarded as triangular sum labeling.

Available online at www.ignited.in Page 2

Definition : A triangular number is a number got by including all positive whole numbers less than or equivalent to a given positive number n. In the event that nth triangular number is indicated by Tn then . It is simple to watch that there does not exist continuous numbers which are triangular numbers. Definition : A triangular sum labeling of a graph G is a coordinated capacity f : V → N ( where N is the situated of all non-negative whole numbers) that affects a bijection f+ : E(G) → {T1, T2, ... , Tn} of the edges of G characterized by . The diagram which affirms such marking is called a triangular sum graph. This idea was presented by Hegde and Shankaran . In the same paper they got a fundamental condition for an Eulerian chart to concede a triangular entirety marking. In addition they examined certain classes of charts which might be implanted as a prompted subgraph of a triangular sum graph. In the present work we examine certain classes of charts which does not confirm a triangular sum labeling. Definition : The helm graph Hn is the graph obtained from a wheel Wn = Cn + K1 by attaching a pendant edge at each vertex of Cn. Definition : The graph G = < Wn : Wm > is the graph obtained by joining apex vertices of wheels Wn and Wm to a new vertex x. ( A vertex corresponding to K1 in Wn = Cn + K1 is called an apex vertex.) Definition : A chord of a cycle Cn is an edge joining two non-adjacent vertices of cycle Cn. Definition : Two chords of a cycle are said to be twin chords if they form a triangle with an edge of the cycle Cn.

Definition : If we change, in Definition, the limitation of the qualities of the edges to be any q triangular numbers then we depict the chart, which accedes this sort of naming as a diagram which might be installed as an instigated subgraph of a triangular sum graph, since this chart could be inserted as a part of a greater chart which is a triangular sum graph. Theorem : Every tree might be installed as an affected subgraph of a triangular sum graph. Evidence: For each tree we can begin from any way of this tree, which is demonstrated to be a triangular sum graph. Presently by applying the past Lemma we can include fitting vertices to get the definitive tree with probability to be a subgraph of a greater tree. Case: In Figure we will apply Theorem, on the tree (A): first we name the way P4, as indicated in (a) then we apply Lemma six times in the following 6 steps to get the tree (A) inserted as an affected subgraph of a triangular sum graph. Observation : In Table we give the first 90 triangular numbers, each of them is given as its remainder divided by 9 and as its multiple of the number 9: Comments:

Available online at www.ignited.in Page 3

1. We acknowledge that all amounts of the shape are triangular numbers again of the shape . (It is straightforward to demonstrate this for each ) 2. We see that for each there are two sequential amounts of remnants 0 the point when partitioned by 9, consistent with this tenet: . Also there exist four successive triangular amounts of the structure: with remnants 1,0,0,1 individually when isolated by 9,such that and . Theorem : Every cycle could be implanted as an actuated subgraph of a triangular sum graph. Verification: Even cycles: In Figure we display an even cycle to be marked as accompanies:

Triangular number : A triangular number is a number got by including all positive whole numbers less than alternately equivalent to a given positive whole number n. Assuming that nth triangular number is indicated by Tn then . It is simple to watch that there does not exist continuous numbers which are triangular numbers. Triangular whole chart : A triangular sum labeling of a graph G is a balanced capacity ( where N is the situated of all non-negative whole numbers) that actuates a bijection of the edges of G outlined by . The chart which allows such naming is called a triangular sum graph. Some existing outcomes : This thought was presented by Hegde and Shankaran and they demonstrated that _ Path Pn, Star K1,n are triangular sum graphs.

• Any tree got from the star K1,n by swapping every edge by a way is a triangular total diagram.

• The lobster T got by joining the focuses of k duplicates of a stat to another vertex w is a triangular sum graph.

• The complete n-ary tree Tm of level m is a triangular sum graph.

• The complete chart Kn is triangular entirety if and

just if . They too indicated that

• If G is an Eulerian (p,q)-diagram acceding a

triangular sum labeling then (mod 12).

• The dutch windmill DW(n)(n duplicates of K3 offering a regular vertex) is not a triangular total diagram.

• The complete chart K4 could be installed as an instigated subgraph of a triangular sum graph.

• In a paper by Vaidya et al. it has been indicated that

• In any triangular entirety diagram G the vertices with names 0 and 1 are dependably neighboring.

• In any triangular sum graph G, 0 and 1 can't be the vertex names in the same triangle held in G.

• In any triangular sum graph G, 1 and 2 can't be the vertex names of the same triangle held in G.

• The rudder diagram Hn is not a triangular sum graph.

• If each edge of a chart G is an edge of a triangle then G is not a triangular sum graph.

As each graph is not a triangular sum graph it is extremely engaging to research charts or diagram families which are not triangular sum graphs yet they could be installed as an instigated subgraph of a triangular sum graph. We demonstrate that cycle, cycle with one harmony and cycle with twin harmonies might be implanted as an instigated subgraph of a triangular sum graph. As each diagram does not allow a triangular sum labeling, it is extremely fascinating to explore classes of diagrams which are not triangular sum graphs and to implant classes of diagrams as an instigated subgraph of a triangular sum graph. We explore numerous classes of diagrams which does not affirm triangular sum labeling. In addition we demonstrate that cycle, cycle with one harmony and cycle with twin harmonies might be implanted as an instigated subgraph of

Available online at www.ignited.in Page 4

a triangular sum graph. This work donate numerous new come about to the speculation of diagram marking.

• D M Burton, Elementary Number Theory, Brown Publishers, Second Edition(1990).

• J A Gallian,A Dynamic Survey of Graph Labeling The Electronic Journal of Combinatorics, 16(2009), #DS6.

• J. Gross and J Yellen, Handbook of Graph Theory, CRC Press.

• S M Hegde and P Shankaran, On Triangular Sum Labeling of Graphs in: B D Acharya, S Arumugam, A Rosa Ed., Labeling of Discrete Structures and Applications, Narosa Publishing House, New Delhi(2008) 109-115.

• J. A. Gallian A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics (November 17, 2011), DS6.

• F. Harary, Graph theory, (Addison Wesley, Reading, Massachusetts. 1969).

• S. M. Hegde and P. Shankaran, On Triangular Sum Labeling of Graphs, Labeling of Discrete Structure and Applications, (Narosa Publishing House, New Delhi, India).

• J.A. Gallian. A dynamic survey of graph labelling. The Electronic Journal of Combinatorics(DS6), pages 1–148, 2005.

• B.D. Acharya and S. M. Hegde. On certain vertex valuations of graphs. Indian J. Pure Appl Math., 22:553–560, 1991.

• G M Du, Cordiality of complete k-partite graphs and some special graphs, Neimenggu Shida Xuebao Ziran Kexue Hanwen Ban, (1997), 9–12.