JEMBATAN PADA GRAF FUZZY INTUITIONISTIC
Abstract
An intuitionistic fuzzy graph consist of a couples of node sets V and set of edges E which the sum of degree membership and degree non membership each of nodes and each of edges in closed interval [0,1], the degree membership each of edges is less than or equal with the minimum of degree membership each of related nodes, and degree non membership each of edges is less than or equal with the maximum degree non membership each of related nodes. An intuitionistic fuzzy graph H can be said as intuitionistic fuzzy subgraph from intuitionistic fuzzy graph G if node set V of H is subset of node set V of G and edge set E of H is subset of edge set E of G. If there is an intuitionistic fuzzy graph G with nodes set of V and if each of edge has degree membership and non membership unconstantly, then G has at least one bridge. The theorem is proven to hold if the intuitionistic fuzzy graph has cycle.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish in UJMC (Unisda Journal of Mathematics and Computer Science) agree to the following terms:
1.Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
2.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
3.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
