In This Paperwe Demonstrate That Each Tree Could Be Inserted As a Triangular Sum Graph,Which May Give a Stage Send In the Guess "Each Tree Is a Triangular Wholediagram" . Additionally We Demonstrate That Each Cycle Might Be Insertedas an Incited Subgraph of a Triangular Sum Graph, Giving some Identifiedeffects. We Name some Groups of Triangular Sum Graphs. Let G = (V,E)Be a Diagram With P Vertices a Q Edges. a Chart G Is Stated to Allow Atriangular Aggregate Naming Assuming That Its Vertices Could Be Named Bynon-Negative Whole Numbers Such That Incited Edge Marks Got By the Entirety Ofthe Names of Close Vertices Are the First Q Triangular Numbers. a Chart G Whichaffirms a Triangular Entirety Marking Is Called a Triangular Entirety Chart. Inthe Present Work We Research Certain Classes of Diagrams Which Does Not Concedea Triangular Entirety Marking. Likewise We Demonstrate That Certain Classes Ofdiagrams Might Be Installed As an Impelled Subgraph of a Triangular Sum Graph.This Work Is a Decent Creation of Diagram Hypothesis and Combinatorial Numberhypothesis.