A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...

In this paper, we give the correlation and difference between M-convex fuzzy process and SLW-convex fuzzy process, and present some basic properties of these convex fuzzy processes, which improve some known results about the connection between those convex fuzzy processes and their graphs. In addition, we introduce a new notion of s-convex fuzzy process as a generalization of M-convex fuzzy pro...

Doubt m-polar subalgebras (ideals) were introduced and some properties investigated. Also, doubt positive implicative (commutative) ideals defined related results proved.

matroids are important combinatorial structures and connect close-lywith graphs. matroids and graphs were all generalized to fuzzysetting respectively. this paper tries to study  connections betweenfuzzy matroids and fuzzy graphs. for a given fuzzy graph, we firstinduce a sequence of matroids  from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. a fuzzy matroid, named graph fuzzy matro...

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...