Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal KADIKMA
Hilmiyah Hanani
FKIP UNEJ
Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
NILAI KETAKTERATURAN TOTAL SISI DARI GRAF TANGGA PERMATA Hilmiyah Hanani; S Slamin; D Dafik
KadikmA Vol 5 No 1 (2014): April 2014
Publisher : Department of Mathematics Education , University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/kdma.v5i1.1277

Abstract

Abstract. Let graph G = (V,E) has V vertices and E edges. For every two different edges of graph G has total irregularity strength labelling ofG ifωt(e) ≠ ωt(f) where graph G = (V,E) has V vertices and E edges. The weight edge ofxy of a graph G is ????(xy) =????x) +????xy) + ????y) where ????x) is the label vertex x and ????y) is the label vertex y and ????xy) is the label edge of the xy. The minimum value on the biggest labels make a graph G, has irregular labeling which is defined as total edge irregularity strength and denoted by tes(G). In this article, The total edge irregularity strength of diamond ladder graph and the union of diamond ladder graphs (isomorphic) are determined. The diamond ladder graph, denoted by Dln, is a graph consisting ofn diamond (n ≥2) . Key Words : Total edge irregularity strength, Diamond Ladder Graph (Dln)
Co-Authors D. Dafik S Slamin