CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

Introducing a simple method for detecting the path between two different vertices in the Graphs

عنوان مقاله: Introducing a simple method for detecting the path between two different vertices in the Graphs
شناسه ملی مقاله: JR_JMCS-4-4_002
منتشر شده در در سال 1402
مشخصات نویسندگان مقاله:

Hossein Jafari - Young Researchers and Elite Club, Arak Branch, Islamic Azad University, Arak, Iran.
Setareh Salehfard - Department of Computer Science, Arak Branch, Islamic Azad University, Arak, Iran.
Dariush Aqababaei Dehkordi - Department of Mathematics, Shahrekord university, shahrekord, Iran.

خلاصه مقاله:
The problem of path detection in graphs has been proposed from the past up to present, and various solutions have been proposed for this purpose, but it is often not an easy task to implement these methods on a computer. In this paper, a technique for detecting paths in a graph will be introduced using matrix algebra, which makes it possible to implement this rule on a computer. This method can be helpful the optimization of tree-spanning trees in networks. At the end of this study, a numerical example is solved using the proposed method.

کلمات کلیدی:
Discrete Mathematics, Optimization, Path Design, Graph Theory

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1878815/