Abstract
Fuzzy autocatalytic set (FACS) is one of the branch from graph theory. This FACS is used to introduce the fuzziness on connectivity of a graph. The introduction of FACS has given more accurate concept in application according a real-life problem. In this paper, some properties on fuzzy autocatalytic set of a graph theory is presented. This result give a new insight of FACS which is then expand the development of Fuzzy autocatalytic set (FACS) in the future.
Highlights
Graph theory is one of mathematical disciplines
The problem is to find a walkthrough of the city, where islands can only be reached via bridges
An autocatalytic refers to a product or compounds used to speed up a chemical reaction known as catalyst
Summary
Graph theory is one of mathematical disciplines. It was first introduced by Swiss mathematician Leonhard Euler to solve the Seven Bridges of Knigsberg problem [1]. Graph is defined as the networks of points or nodes that are connected by links [2]. It can be described as a set of lines that used to connect to the set of points [4]. An irreducible graph is defined as strongly connected graphs. All strongly connected graphs are stated as irreducible, but not for a graph which consist only single vertex and no edges
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
