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...

A fuzzy graph (f-graph) is a pair G : (σ, μ) where σ is a fuzzy subset of a set S and μ is a fuzzy relation on σ. A fuzzy graph H : (τ, υ) is called a partial fuzzy subgraph of G : (σ, μ) if τ (u) ≤ σ(u) for every u and υ (u, v) ≤ μ(u, v) for every u and v . In particular we call a partial fuzzy subgraph H : (τ, υ) a fuzzy subgraph of G : (σ, μ ) if τ (u) = σ(u) for every u in τ * and υ (u, v) ...

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...

In this paper, the poset $BX$ of formal balls is studied in fuzzy partial metric space $(X,p,*)$. We introduce the notion of layered complete fuzzy partial metric space and get that the poset $BX$ of formal balls is a dcpo if and only if $(X,p,*)$ is layered complete fuzzy partial metric space.

We present a reduction between subgraph isomorphism and minimal partial subgraph isomorphism. We also provide a new reduction between graph isomorphism and minimal partial graph isomorphism. The new reduction is more efficient and simpler than the previous reduction and can be generalized to subgraph isomorphism. In addition, we show that a reduction from graph isomorphism that makes only one c...

The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, or a partial subgraph, obtained by removing arcs and nodes. In this paper, we introduce two soft CSPs which model these two maximum common subgraph problems in a unified framework. We also introduce and compare differe...