Introducing a simple method for detecting the path between two different vertices in the Graphs
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 us...
Main Authors: | Hossein Jafari, Setareh Salehfard, Dariush Aqababaei Dehkordi |
---|---|
Format: | Article |
Language: | English |
Published: |
Qom University of Technology
2024-01-01
|
Series: | Mathematics and Computational Sciences |
Subjects: | |
Online Access: | https://mcs.qut.ac.ir/article_709231_4fc54004e1bab22d1c223c5496bcecb3.pdf |
Similar Items
-
End Simplicial Vertices in Path Graphs
by: Gutierrez Marisa, et al.
Published: (2016-05-01) -
Constructing an Evolutionary Tree and Path–Cycle Graph Evolution along It
by: Konstantin Gorbunov, et al.
Published: (2023-04-01) -
Paths of specified length in random k-partite graphs
by: C.R. Subramanian
Published: (2001-01-01) -
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs
by: Christian Löwenstein, et al.
Published: (2014-02-01) -
On Path-Pairability in the Cartesian Product of Graphs
by: Mészáros Gábor
Published: (2016-08-01)