LINEAR DUAL GRAPH CALCULUS AND ITS APPLICATIONS IN GIS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SABERIAN J.; MALEK M.R.; HAMRAH M.; WINTER S.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Remote Sensing & GIS Year:2009 | Volume:1 | Issue:1 Page(s): 1-16

Download Full-Text

Persian Verion

View:

1,400

Download:

Cites:

Information Journal Paper

Title

LINEAR DUAL GRAPH CALCULUS AND ITS APPLICATIONS IN GIS

Author(s)

SABERIAN J. | MALEK M.R. | HAMRAH M. | WINTER S. | Issue Writer Certificate

Keywords

GRAPHQ3

LINEAR DUAL GRAPHQ2

EULERIAN CYCLEQ3

HAMILTONIAN CYCLEQ3

TRIP PLANNINGQ3

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 GRAPHs with 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.

Cites

No record.

References

No record.

Cite

APA: Copy

SABERIAN, J., MALEK, M.R., HAMRAH, M., & WINTER, S.. (2009). LINEAR DUAL GRAPH CALCULUS AND ITS APPLICATIONS IN GIS. REMOTE SENSING & GIS, 1(1), 1-16. SID. https://sid.ir/paper/184181/en

Vancouver: Copy

SABERIAN J., MALEK M.R., HAMRAH M., WINTER S.. LINEAR DUAL GRAPH CALCULUS AND ITS APPLICATIONS IN GIS. REMOTE SENSING & GIS[Internet]. 2009;1(1):1-16. Available from: https://sid.ir/paper/184181/en

IEEE: Copy

J. SABERIAN, M.R. MALEK, M. HAMRAH, and S. WINTER, “LINEAR DUAL GRAPH CALCULUS AND ITS APPLICATIONS IN GIS,” REMOTE SENSING & GIS, vol. 1, no. 1, pp. 1–16, 2009, [Online]. Available: https://sid.ir/paper/184181/en

Related Journal Papers