Linear Dual Graph Calculus and its Applications in GIS
Author(s):
Abstract:
In order to solve some problems, as well as to simplify or facilitate some analyses in graphs, some changes can be made in the graphs. Dual graph is one of these changes. Linear dual graph is a type of dual graph that is proposed for presenting graphswith weighted nodes. In this paper, linear dual graph calculus that is based on the linear dual graph is introduced. For this purpose, at first, Linear Dual (LD1) and inverse Linear Dual (LD-1) is introduced, and then, the way of their extraction is explained. After that some applications of this calculus is explained. One of its most important applications is in specification the Hamiltonian cycle in graphs. In other words, by transportation between linear dual graph and the primal graph,we can convert the Hamiltonian cycles whose specification has always been so difficult, to Eulerian ones which can be easily recognized.
Language:
Persian
Published:
Iranian Journal of Remote Sencing & GIS, Volume:1 Issue: 1, 2009
Page:
1
magiran.com/p782413
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!