ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

LI HUI; ZHANG BO; PENG JIN

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Fuzzy Systems Year:2018 | Volume:15 | Issue:2 Page(s): 89-108

Download Full-Text

Persian Verion

View:

938

Download:

216

Cites:

Information Journal Paper

Title

ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH

Author(s)

LI HUI | ZHANG BO | PENG JIN | Issue Writer Certificate

Keywords

UNCERTAINTY THEORYQ2

UNCERTAIN MEASUREQ2

MAXIMUM MATCHINGQ2

MATCHING NUMBERQ2

UNCERTAIN GRAPHQ2

Abstract

Uncertain graphs are employed to describe graph models with in-deterministic information that produced by human beings. This paper aims to study the MAXIMUM MATCHING problem in UNCERTAIN GRAPHs. The number of edges of a MAXIMUM MATCHING in a graph is called MATCHING NUMBER of the graph. Due to the existence of uncertain edges, the MATCHING NUMBER of an UNCERTAIN GRAPH is essentially an uncertain variable. Different from that in a deterministic graph, it is more meaningful to investigate the UNCERTAIN MEASURE that an UNCERTAIN GRAPH is k-edge matching (i.e., the MATCHING NUMBER is greater than or equal to k). We first study the properties of the MATCHING NUMBER of an UNCERTAIN GRAPH, and then give a fundamental formula for calculating the UNCERTAIN MEASURE. We further prove that the fundamental formula can be transformed into a simplified form. What is more, a polynomial time algorithm to numerically calculate the UNCERTAIN MEASURE is derived from the simplified form. Finally, some numerical examples are illustrated to show the application and efficiency of the algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

LI, HUI, ZHANG, BO, & PENG, JIN. (2018). ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH. IRANIAN JOURNAL OF FUZZY SYSTEMS, 15(2 ), 89-108. SID. https://sid.ir/paper/113234/en

Vancouver: Copy

LI HUI, ZHANG BO, PENG JIN. ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH. IRANIAN JOURNAL OF FUZZY SYSTEMS[Internet]. 2018;15(2 ):89-108. Available from: https://sid.ir/paper/113234/en

IEEE: Copy

HUI LI, BO ZHANG, and JIN PENG, “ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH,” IRANIAN JOURNAL OF FUZZY SYSTEMS, vol. 15, no. 2 , pp. 89–108, 2018, [Online]. Available: https://sid.ir/paper/113234/en

Related Journal Papers