Results 21 to 30 of about 7,663 (277)
Pareto Optimality and Strategy Proofness in Group Argument Evaluation (Extended Version) [PDF]
, 2017 An inconsistent knowledge base can be abstracted as a set of arguments and a defeat relation among them. There can be more than one consistent way to evaluate such an argumentation graph.
Awad, Edmond +4 more
core +5 more sources
Discrete Mathematics, 2013 Which graphs admit an integer value harmonic function which is injective and surjective onto $\Z$? Such a function, which we call harmonic labeling, is constructed when the graph is the $\Z^2$ square grid. It is shown that for any finite graph $G$ containing at least one edge, there is no harmonic labeling of $ G \times \Z$.
Benjamini, Itai +3 more
openaire +2 more sources
All trees are six-cordial [PDF]
, 2017 For any integer $k>0$, a tree $T$ is $k$-cordial if there exists a labeling of the vertices of $T$ by $\mathbb{Z}_k$, inducing a labeling on the edges with edge-weights found by summing the labels on vertices incident to a given edge modulo $k$ so that ...
Driscoll, Keith +2 more
core +2 more sources
AKCE International Journal of Graphs and Combinatorics, 2020 A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex.
Jaroslav Ivančo
doaj +1 more source
Enumeration Of Labelled Graphs [PDF]
Canadian Journal of Mathematics, 1956 1. Introduction. The number of connected linear graphs having V vertices labelled 1, … , V and λ (unlabelled) lines is found below. Similar formulas are found for graphs in which slings, lines “in parallel,” or both are allowed and for directed graphs with or without slings or parallel lines.
openaire +2 more sources
Langford sequences and a product of digraphs [PDF]
, 2015 Skolem and Langford sequences and their many generalizations have applications in numerous areas. The $\otimes_h$-product is a generalization of the direct product of digraphs. In this paper we use the $\otimes_h$-product and super edge-magic digraphs to
López, Susana-Clara +1 more
core +4 more sources
Parallelism Detection Using Graph Labelling
Lobachevskii Journal of Mathematics, 2022 Usage of multiprocessor and multicore computers implies parallel programming. Tools for preparing parallel programs include parallel languages and libraries as well as parallelizing compilers and convertors that can perform automatic parallelization. The basic approach for parallelism detection is analysis of data dependencies and properties of program
Telegin, P. N. +3 more
openaire +2 more sources
Series-Parallel Operations with Alpha-Graphs
Theory and Applications of Graphs, 2019 Among difference vertex labelings of graphs, $\alpha$-labelings are the most restrictive one. A graph is an $\alpha$-graph if it admits an $\alpha$-labeling.
Christian Barrientos, Sarah Minion
doaj +1 more source
Radio Number of Hamming Graphs of Diameter 3
Theory and Applications of Graphs, 2022 For $G$ a simple, connected graph, a vertex labeling $f:V(G)\to \Z_+$ is called a \emph{radio labeling of $G$} if it satisfies $|f(u)-f(v)|\geq\diam(G)+1-d(u,v)$ for all distinct vertices $u,v\in V(G)$.
Jason DeVito +2 more
doaj +1 more source
Discrete Mathematics, 1994 In this note, Schützenberger's notion of evacuation of Young tableaux [\textit{M. P. Schützenberger}, Math. Scand. 12, 117-128 (1963; Zbl 0216.302)] and of naturally labelled posets [\textit{M. P. Schützenberger}, Discrete Math. 2, 73-94 (1972; Zbl 0279.06001)] are extended to labelled graphs.
MALVENUTO, Claudia, REUTENAUER C.
openaire +2 more sources