کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647453 | 1342352 | 2013 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Guides and shortcuts in graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Guides and shortcuts in graphs Guides and shortcuts in graphs](/preview/png/4647453.png)
چکیده انگلیسی
The geodesic structure of a graph appears to be a very rich structure. There are many ways to describe this structure, each of which captures only some aspects. Ternary algebras are for this purpose very useful and have a long tradition. We study two instances: signpost systems, and a special case of which, step systems. Signpost systems were already used to characterize graph classes. Here we use these for the study of the geodesic structure of a connected spanning subgraph FF with respect to its host graph GG. Such a signpost system is called a guide to (F,G)(F,G). Our main results are: the characterization of the step system of a cycle, the characterization of guides for spanning trees and hamiltonian cycles.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 313, Issue 19, 6 October 2013, Pages 1897–1907
Journal: Discrete Mathematics - Volume 313, Issue 19, 6 October 2013, Pages 1897–1907
نویسندگان
Henry Martyn Mulder, Ladislav Nebeský,