Abstract
This paper discusses fuzzy labeling graph and its properties. The properties discussed are fuzzy labeling subgraph, union graph, and fuzzy magic graph. The results showed that the strength of connectedness for pair of vertices in a graph with fuzzy labeling is always greater than or equal to the strength of connectedness for pair of vertices in its subgraph. In addition, union of two graph with fuzzy labeling will form a graph with fuzzy labeling. Meanwhile, on magic labeling there is always a fuzzy bridge on fuzzy magic graph.
Highlights
The results showed that the strength of connectedness for pair of vertices in a graph with fuzzy labeling is always greater than or equal to the strength of connectedness for pair of vertices in its subgraph
Graf dengan pelabelan fuzzy G (V , E) dikatakan graf ajaib fuzzy jika (u) (u, v) (v) memiliki nilai yang sama untuk setiap u, v V
Summary
Jika H ( , ) adalah subgraf dengan pelabelan fuzzy dari G ( , ) maka (u, v) (u, v) untuk setiap u, v V . Misalkan G ( , ) adalah sembarang graf dengan pelabelan fuzzy dan H ( , ) adalah subgraf dengan pelabelan fuzzy dari G sehingga berlaku (u,v) (u, v) untuk setiap u, v V . Gabungan dari dua graf dengan label fuzzy G1 dan G2 merupakan graf dengan pelabelan fuzzy, jika nilai fungsi untuk setiap simpul dan sisi G1 dan G2 berbeda.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Jurnal Ilmiah Matematika dan Pendidikan Matematika
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
