M. Anholcer

activity

20112025

most citedDistance magic labeling and two products of graphs

20 citations · 99 across the 20 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.OC2015★ 15 cited

Deriving Priorities From Inconsistent PCM using the Network Algorithms

Marcin Anholcer, Janos Fülöp

In several multiobjective decision problems Pairwise Comparison Matrices (PCM) are applied to evaluate the decision variants. The problem that arises very often is the inconsistenc…

math.CO2015★ 14 cited

Spectra of Graphs and Closed Distance Magic Labelings

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Let $G = (V, E)$ be a graph of order $n$ . A closed distance magic labeling of $G$ is a bijection $ℓ : V (G) \to {1, \dots, n}$ for which there exists a positive intege…