آمار
| تعداد نشریات | 6 |
| تعداد شمارهها | 123 |
| تعداد مقالات | 1,565 |
| تعداد مشاهده مقاله | 1,686,154 |
| تعداد دریافت فایل اصل مقاله | 1,572,597 |
The topological ordering of covering nodes | ||
| Communications in Combinatorics and Optimization | ||
| مقاله 15، دوره 5، شماره 1، شهریور 2020، صفحه 55-60 اصل مقاله (351.64 K) | ||
| نوع مقاله: Original paper | ||
| شناسه دیجیتال (DOI): 10.22049/cco.2019.26119.1077 | ||
| نویسندگان | ||
| Gholam Hassan Shirdel* ؛ Nasrin Kahkeshani | ||
| University of Qom | ||
| چکیده | ||
| The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological ordering algorithm on graphs containing the covering nodes. We show that there exists a cut set with forward arcs in these graphs and the order of the covering nodes is successive. | ||
| کلیدواژهها | ||
| Directed graph؛ Covering nodes؛ Topological ordering algorithm | ||
| مراجع | ||
|
[1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: theory, algorithms and applications, Prentice Hall, Upper Saddle River, New Jersey, 1993.
[2] B. Dutta and M.O. Jackson, Networks and Groups: Models of Strategic Formation, Springer Science & Business Media, 2013.
[3] M.O. Jackson, Social and economic networks, Princeton University Press, , Princeton, NJ, 2010.
[4] R.H.P. Janssen and H. Monsuur, Stable network topologies using the notion of covering, Europ. J. Oper. Res. 218 (2012), no. 3, 755–763.
[5] E.Y. Jin and C.M. Reidys, Combinatorial design of pseudoknot rna, Adv. Appl. Math. 42 (2009), no. 2, 135–151.
[6] N.R. Miller, A new solution set for tournaments and majority voting: Further graph-theoretical approaches to the theory of voting, Amer. J. Pol. Sci. 24 (1980), no. 1, 68–96.
[7] H. Monsuur and T. Storcken, Centers in connected undirected graphs: an axiomatic approach, Oper. Res. 52 (2004), no. 1, 54–64.
| ||
|
آمار تعداد مشاهده مقاله: 759 تعداد دریافت فایل اصل مقاله: 545 |
||