ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
From MaRDI portal
Publication:4963120
DOI10.22111/ijfs.2018.3761zbMath1400.05194OpenAlexW2729781048MaRDI QIDQ4963120
Publication date: 6 November 2018
Full work available at URL: https://ijfs.usb.ac.ir/article_3761_843af24ca521b1d9f207a6a79751dcc4.pdf
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (2)
Cites Work
- Euler index in uncertain graph
- On distribution function of the diameter in uncertain graph
- Shortest path problem with uncertain arc lengths
- The maximum flow problem of uncertain network
- Degree sequences of random graphs
- Fuzzy graphs and fuzzy hypergraphs
- Node connectivity and arc connectivity of a fuzzy graph
- On the strength of connectedness of a random graph
- Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights
- CONNECTEDNESS INDEX OF UNCERTAIN GRAPH
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- On the structure of random plane‐oriented recursive trees and their branches
- Regularity index of uncertain graph
- Fuzzy k-Competition Graphs and p-Competition Fuzzy Graphs
- Paths, Trees, and Flowers
- Fuzzy sets
- Random Graphs
- Uncertainty theory
- Uncertainty theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH