Structural Properties of Twin-Free Graphs

Structural Properties of Twin-Free Graphs

Consider a connected undirected graph G = (V,E), a subset of vertices C ⊆ V , and an integer r ≥ 1; for any vertex v ∈ V , let Br(v) denote the ball of radius r centered at v, i.e., the set of all vertices linked to v by a path of at most r edges. If for all vertices v ∈ V , the sets Br(v) ∩C are all nonempty and different, then we call C an r-identifying code. A graph admits at least one r-ide...

Structural properties of fuzzy graphs

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 Structural Properties of Even Free Graphs

The Structural Properties of Even Free Graphs

structural properties of fuzzy graphs

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