Connectedness strength of two vertices in an uncertain graph
From MaRDI portal
Publication:2868168
DOI10.1080/00207160.2012.727404zbMath1278.05195OpenAlexW2046903046MaRDI QIDQ2868168
Publication date: 23 December 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.727404
Reasoning under uncertainty in the context of artificial intelligence (68T37) Connectivity (05C40) Fractional graph theory, fuzzy graph theory (05C72)
Related Items
Euler index of uncertain random graph: concepts and properties ⋮ Uncertain programming models for portfolio selection with uncertain returns ⋮ An uncertain chromatic number of an uncertain graph based on \(\alpha \)-cut coloring
Cites Work
- Euler index in uncertain graph
- Types of arcs in a fuzzy graph
- Existence and uniqueness theorem for uncertain differential equations
- Degree sequences of random graphs
- On M-strong fuzzy graphs.
- Theory and practice of uncertain programming.
- Fuzzy graphs modelling for hazmat telegeomonitoring
- A new class of scale free random graphs
- UNCERTAIN OPTIMAL CONTROL WITH APPLICATION TO A PORTFOLIO SELECTION MODEL
- On Moore Graphs with Diameters 2 and 3
- CONNECTEDNESS INDEX OF UNCERTAIN GRAPH
- ON LIU'S INFERENCE RULE FOR UNCERTAIN SYSTEMS
- Cycles in digraphs– a survey
- Fuzzy line graphs
- On automorphisms of fuzzy graphs
- On the structure of random plane‐oriented recursive trees and their branches
- Fuzzy sets
- Random Graphs
- A theorem on n-connected graphs
- Some Theorems on Abstract Graphs
- Lower bounds for some Ramsey numbers
- The diameter of sparse random graphs
This page was built for publication: Connectedness strength of two vertices in an uncertain graph
