کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4638361 1632000 2016 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On graphs associated to sets of rankings
ترجمه فارسی عنوان
در نمودارهای مرتبط با مجموعه های رتبه بندی
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
چکیده انگلیسی

In this paper we analyze families of rankings by studying structural properties of graphs. Given a finite number of elements and a set of rankings of those elements, two elements compete when they exchange their relative positions in at least two rankings, and we can associate an undirected graph to a set of rankings by connecting elements that compete. We call this graph a competitivity graph. Competitivity graphs have already appeared in the literature as co-comparability graphs, ff-graphs or intersection graphs associated to a concatenation of permutation diagrams. We introduce certain important sets of nodes in a competitivity graph. For example, nodes that compete among them form a competitivity set and nodes connected by chains of competitors form a set of eventual competitors. These sets are analyzed and a method to obtain sets of eventual competitors directly from a set of rankings is shown.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 291, 1 January 2016, Pages 497–508
نویسندگان
, , , ,