کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8902896 1632394 2018 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Reconfiguration graphs of shortest paths
ترجمه فارسی عنوان
نمودارهای تصحیح کوتاهترین مسیرها
کلمات کلیدی
نمودارهای تصحیح، کوتاهترین مسیرها، غرق شدن نمودار شبکه،
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
چکیده انگلیسی
For a graph G anda,b∈V(G), the shortest path reconfiguration graph of G with respect to a andb is denoted by S(G,a,b). The vertex set of S(G,a,b) is the set of all shortest paths between a andb in G. Two vertices in V(S(G,a,b)) are adjacent, if their corresponding paths in G differ by exactly one vertex. This paper examines the properties of shortest path graphs. Results include establishing classes of graphs that appear as shortest path graphs, decompositions and sums involving shortest path graphs, and the complete classification of shortest path graphs with girth 5 or greater. We include an infinite family of well structured examples, showing that the shortest path graph of a grid graph is an induced subgraph of a lattice.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 341, Issue 10, October 2018, Pages 2938-2948
نویسندگان
, , , , , ,