Article Per Year (5 Year)
p-Index From 2021 - 2026
0.659
P-Index
This Author published in this journals
All Journal MATEMATIKA SAINS DAN MATEMATIKA Unisda Journal of Mathematics and Computer Science (UJMC) Jurnal Pasopati : Pengabdian Masyarakat dan Inovasi Pengembangan Teknologi Journal of Soft Computing Exploration Journal of Fundamental Mathematics and Applications (JFMA) Prosiding Konferensi Nasional Penelitian Matematika dan Pembelajarannya International Journal of Computing Science and Applied Mathematics-IJCSAM
Bambang Irawanto
Departemen Matematika, Fakultas Sains Dan Matematika Universitas Diponegoro, Jl. Prof. Sudarto, SH, Tembalang, Semarang, Indonesia 50275
Aerospace Engineering Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Decision Sciences, Operations Research & Management Earth & Planetary Sciences Education Electrical & Electronics Engineering Environmental Science Industrial & Manufacturing Engineering Mathematics

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

Found 1 Documents
Search
Journal : Unisda Journal of Mathematics and Computer Science (UJMC)

 1 
JEMBATAN PADA GRAF FUZZY INTUITIONISTIC Siti Alfiatur Rohmaniah; Bayu Surarso; Bambang Irawanto
Unisda Journal of Mathematics and Computer Science (UJMC) Vol 1 No 01 (2015): Unisda Journal of Mathematics and Computer Science
Publisher : Mathematics Department of Mathematics and Natural Sciences Unisda Lamongan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1462.553 KB) | DOI: 10.52166/ujmc.v1i01.438

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.
Co-Authors A, Nunung Amalia Alifiani, Amalia Ambar Puspasari, Ambar Aulia, Lathifatul Aurora Nur Aini Bambang Supriyadi Bayu Surarso Bibit Waluyo Aji Desfri Kurniawan Djuwandi Djuwandi Eddy Prianto Fihris Aulia Sa’adah Handayani, Rizky Ikhsan Rizki K. Jiwangga, Sesar Sukma Juwanda, Farikhin Lucia Ratnasari Lucia Ratnasari Mohammad Ervan S, Mohammad Ervan Mohammad Ervan S., Mohammad Ervan Nanda Puspitasari, Nanda Nikken Prima Puspita Ratri Wulandari Redemtus Heru Tjahjana rizki, ikhsan Robertus Heri Sulistyo Utomo Santi Widyaningsih Shintia Devi Wahyudy, Shintia Devi Siti Alfiatur Rohmaniah Solikhin Solikhin Sri Nur Chasanah Sulastri Daruni Sunarsih . Sunarsih Sunarsih Suryoto ., Suryoto Suryoto Suryoto Utomo, R. Heri Soelistyo Utomo, R. Heri Soelistyo Widowati ., Widowati Yuni Hidayati