Results 91 to 100 of about 90,485 (281)

t-Norm Fuzzy Incidence Graphs

open access: yesMathematics, 2018
It is the case that, in certain applications of fuzzy graphs, a t-norm, instead of a minimum, is more suitable. This requires the development of a new theory of fuzzy graphs involving an arbitrary t-norm in the basic definition of a fuzzy graph. There is
John N. Mordeson, Sunil Mathew
doaj   +1 more source

Classifying sequences by the optimized dissimilarity space embedding approach: a case study on the solubility analysis of the E. coli proteome

open access: yes, 2015
We evaluate a version of the recently-proposed classification system named Optimized Dissimilarity Space Embedding (ODSE) that operates in the input space of sequences of generic objects.
Livi, Lorenzo   +2 more
core   +1 more source

GHRHR Deficiency Enhances Retinal Ganglion Cell Survival and Visual Functions in Experimental Glaucoma by Inhibiting Ferroptosis

open access: yesAdvanced Science, EarlyView.
Glaucoma, a major cause of blindness, involves retinal ganglion cell (RGC) degeneration. This study shows growth hormone‐releasing hormone receptor (GHRHR) deficiency preserves RGC survival and restores vision, unlike activation which only aids survival.
Yan Tong   +24 more
wiley   +1 more source

Fuzzy Outerplanar Graphs and Its Applications

open access: yesInternational Journal of Computational Intelligence Systems
The concept of a crisp graph is essential in the study of outerplanar graphs because outerplanar graphs are a unique type of planar graphs containing special characteristics. One of the core concepts of crisp graphs, the notion of a subgraph, is utilized
Deivanai Jaisankar   +3 more
doaj   +1 more source

Connectivity Analysis of Cyclically Balanced Fuzzy Graphs

open access: yesFuzzy Information and Engineering, 2015
The concepts of connectivity and cycle connectivity play an important role in fuzzy graph theory. In this article, cyclic cutvertices, cyclic bridges and cyclically balanced fuzzy graphs are discussed.
N. Jicy, Sunil Mathew
doaj   +1 more source

Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach

open access: yes, 2010
This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and ...
Becker   +42 more
core   +3 more sources

Brain and Liver Dual‐Targeting Oridonin Nanoparticles to Enhance Aβ Clearance for Alzheimer's Disease Therapy

open access: yesAdvanced Science, EarlyView.
We developed a nanoparticle named OAF, which simultaneously targeted to both the brain and liver via the transferrin receptor 1 (TfR1) receptor, promoting lipoprotein receptor‐related protein 1 (LRP1) expression to enhance amyloid‐beta (Aβ) clearance. In AD mice model, OAF significantly reduced Aβ deposition and cognitive impairment, while a mitigating
Wenshuai Gong   +8 more
wiley   +1 more source

Interval-Valued Fuzzy Soft Graphs

open access: yesTopological Algebra and its Applications, 2017
In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur   +2 more
doaj   +1 more source

Microglia‐Targeted Biomimetic Tetrahedral Framework Nucleic Acid Nanovesicles for Synergistic Treatment of Sepsis‐Associated Encephalopathy

open access: yesAdvanced Science, EarlyView.
Sepsis‐associated encephalopathy (SAE) lacks effective therapies. We developed ME@FDsi, a biomimetic nanodrug using a tetrahedral framework nucleic acid to deliver disulfiram and siTNFα. It crosses the blood‐brain barrier, targets M1 microglia, inhibits pyroptosis and inflammation, and scavenges ROS.
Huimin Shi   +15 more
wiley   +1 more source

Perfect Matchings in Claw-free Cubic Graphs [PDF]

open access: yes, 2009
Lovasz and Plummer conjectured that there exists a fixed positive constant c such that every cubic n-vertex graph with no cutedge has at least 2^(cn) perfect matchings.
Oum, Sang-il
core   +1 more source

Home - About - Disclaimer - Privacy