Record Details

JEMBATAN PADA GRAF FUZZY INTUITIONISTIC

Unisda Journal of Mathematics and Computer Science (UJMC)

View Archive Info
 
 
Field Value
 
ISSN 2579-907X
2460-3333
 
Authentication Code dc
 
Title Statement JEMBATAN PADA GRAF FUZZY INTUITIONISTIC
 
Added Entry - Uncontrolled Name Rohmaniah, Siti Alfiatur
Surarso, Bayu
Irawanto, Bambang
Universitas Islam Darul 'Ulum Lamongan
Universitas Diponegoro
Universitas Diponegoro
 
Summary, etc. 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.
 
Publication, Distribution, Etc. Mathematics Department of Mathematics and Natural Sciences Unisda Lamongan
 
Electronic Location and Access application/pdf
http://e-jurnal.unisda.ac.id/index.php/ujmc/article/view/438
 
Data Source Entry Unisda Journal of Mathematics and Computer Science (UJMC); Vol 1 No 01 (2015): Unisda Journal of Mathematics and Computer Science
 
Language Note eng
 
Terms Governing Use and Reproduction Note ##submission.copyrightStatement##