✦ LIBER ✦

Operations on fuzzy graphs

✍ Scribed by John N. Mordeson; Peng Chang-Shyh

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 651 KB
Volume: 79
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(94)90116-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fuzzy adjunctions and fuzzy morphologica

Fuzzy adjunctions and fuzzy morphological operations based on implications

✍ Y. Shi; M. Nachtegael; D. Ruan; E. E. Kerre 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

The concept of adjunction plays an important role in mathematical morphology. If the morphological operations, dilation and erosion form an adjunction in a complete lattice, then they, as well as the closing and opening constructed by them, will fulfill certain required properties in an algebraic co

NEPS operations on cordial graphs

✍ Walter W. Kirchherr 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Operations on fuzzy sets—an axiomatic ap

Operations on fuzzy sets—an axiomatic approach

✍ Erich Peter Klement 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 603 KB

More powerful closure operations on grap

More powerful closure operations on graphs

✍ Yong-jin Zhu; Feng Tian; Xiao-tie Deng 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 1017 KB

Zhu, Y.-J., F. Tian and X.-T. Deng, More powerful closure operations on graphs, Discrete Mathematics 87 (1991) 197-214. Bondy and Chvatal have observed the following result: G = (V, E) is a simple graph of order n. If uu $ E and d(u) + d(u) 2 n, then G is Hamiltonian iff G + uu is Hamiltonian. Thus,

Operator domains on fuzzy groups

✍ K.C. Gupta; B.K. Sarma 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 491 KB

The bandwidth problem and operations on

The bandwidth problem and operations on graphs

✍ J Chvatalova; J Opatrny 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 479 KB

For a given graph G and vertices u, v in G let ,,,~ ~(.,~) G(-,,o) G~, o) denote the graph Gm ~ Va , ~s :, obtained from G by merging vertices u, v, adding edge (u, v), subdividing edge (u, v), contracting edge (u, v) of G, respectively. We give upper and lower bounds for the bandwidth of ~'~ ~(~'~)