A multi-attribute ranking solutions confirmation procedure

Ranking problems arise from the knowledge of several binary relations defined on a set of alternatives, which we intend to rank. In a previous work, the authors introduced a tool to confirm the solutions of multi-attribute ranking problems as linear extensions of a weighted sum of preference relations. An extension of this technique allows the recognition of critical preference pairs of alternatives, which are often caused by inconsistencies. Herein, a confirmation procedure is introduced and applied to confirm the results obtained by a multi-attribute decision methodology on a tender for the supply of buses to the Porto Public Transport Operator. © 2005 Springer Science + Business Media, Inc.

A recursive construction of the regular exceptional graphs with least eigenvalue -2

In spectral graph theory a graph with least eigenvalue 2 is exceptional if it is connected, has least eigenvalue greater than or equal to 2, and it is not a generalized line graph. A ðk; tÞ-regular set S of a graph is a vertex subset, inducing a k-regular subgraph such that every vertex not in S has t neighbors in S. We present a recursive construction of all regular exceptional graphs as successive extensions by regular sets.