Strongest Exact 1-Step Dominating Set for Fuzzy Graphs
Two vertices in a graph are said to dominate each others if they are adjacent A set S of vertices in a g…
Dominating SetStrongest Dominating SetExact 1 Step Dominating Set
پروفایل پژوهشگر
M. Ghorani
۴مقاله
۰کنفرانس
مقالات M. Ghorani
Strength of Fuzzy Domination in Fuzzy Graphs
Two vertices in a graph are said to dominate each other if they are adjacent A set S of vertices in a gr…
Fuzzy graphFuzzy dominating setFuzzy domination number
Pushdown automata based on lattice-valued logic: closure properties and decision problems
This paper introduces the concept of pushdown automata based on complete residuated lattice valued logic…
Lattice-valued pushdown automataLattice-valued languageDecision problems
A Pumping Lemma for Fuzzy Tree Language with a Threshold
In this paper, at first, we recall some preliminaries related to tree automata Then, we define fuzzy tre…
Fuzzy tree automataPumping lemmaDecision problems