Graph theory includes two unavoidable graphs, namely Euler graphs and Hamiltonian graphs. In this study, generalized fuzzy Euler graphs (GFEGs) and generalized fuzzy Hamiltonian graphs (GFHGs) are defined to express uncertain system like routes, networks. Here, even degrees of all vertices of graphs do not assure that the graphs are GFEG. Similarly, other properties of crisp Euler graphs and crisp Hamiltonian graphs are tested. Two algorithms are prepared to find Eulerian circuit in GFEGs and Hamiltonian circuit in GFHGs. In modern life, planning of efficient routes is very important for business and industry purposes. An application on planning of routes is described.
EulerL., Solutio problematis ad geometriam situs pertinentis, Commentarii Academiae Scientiarum Imperialis Petropolitanae8 (1736), 128–140.
2.
KauffmanA., Introduction a la Theorie des Sous-emsembles Flous, et Cie Editeurs, Paris:Masson, 1973.
3.
RosenfeldA., Fuzzy graphs, in: ZadehL.A., FuK.S., ShimuraM., (Eds.), Fuzzy Sets and Their Applications, Academic Press, New York, 1975, pp. 77–95.
4.
ParvathiR. and KarunambigaiM.G., Intuitionistic fuzzy graphs, Computational Intelligence, Theory and Applications38 (2006), 139–150.
5.
MathewS. and SunithaM.S., Types of arcs in a fuzzy graph, Information Sciences179 (2009), 1760–1768.
6.
SamantaS. and PalM., Fuzzy k-competition graphs and p-competition fuzzy graphs, Fuzzy Engineering and Information5(2) (2013), 191–204.
7.
SamantaS. and PalM., Fuzzy planar graphs, IEEE Transaction on Fuzzy Systems23( 6(2015), 1936–1942.
8.
SamantaS., SarkarB., ShinD. and PalM., Completeness and regularity of generalized fuzzy graphs, Springer Plus5(1979) (2016), 1–14.
9.
SarkarB. and SamantaS., Generalized fuzzy trees, International Journal of Computational Intelligence Systems10 (2017), 711–720.
10.
DiracG.A., Some theorems on abstract graphs, Proceedings of London Mathematical Society2 (1952), 69–81.
11.
HamiltonW.R., Account of the icosian calculus, Proceedings of the Royal Irish Academy6 (1858), 415–416.
12.
GoodmanS.E. and HedetniemiS.T., Sufficient Conditions for a graph to be Hamiltonian,, J Combin Theory B (1974), 175–180.
13.
HuraG.S., Determination of all Hamiltonian paths and circuits and the minimal feedback set in a graph through Petri nets, Microelectron Reliab27 (1989), 223–227.
14.
FederT. and MotwaniR., Finding large cycles in Hamiltonian graphs, Discrete Applied Mathematics158 (2010), 882–893.
15.
AkramM. and DudekW.A., Interval valued fuzzy graphs, Computers and Mathematics with Applications61 (2011), 289–299.
16.
AkramM., Bipolar fuzzy graphs, Information Sciences181(24) (2011), 5548–5564.
17.
MaX., LiuQ. and ZhanJ., A survey of decision making methods based on certain hybrid soft set models, Artificial Intelligence Review47 (2017), 507–530.
