Graph labeling
JA Gallian - The electronic journal of combinatorics, 2012 - combinatorics.org
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …
Selective Parallel Loading of Large-Scale Compressed Graphs with ParaGrapher
Comprehensive evaluation is one of the basis of experimental science. In High-Performance
Graph Processing, a thorough evaluation of contributions becomes more achievable by …
Graph Processing, a thorough evaluation of contributions becomes more achievable by …
Generalized Word-Representable Graphs
The literature on word-representable graphs is quite rich, and a number of variations of the
original definition have been proposed over the years. We are initiating a systematic study of …
original definition have been proposed over the years. We are initiating a systematic study of …
Sum labelling graphs of maximum degree two
The concept of sum labelling was introduced in 1990 by Harary. A graph is a sum graph if its
vertices can be labelled by distinct positive integers in such a way that two vertices are …
vertices can be labelled by distinct positive integers in such a way that two vertices are …
[PDF][PDF] On Difference-Labellings for Directed Graphs
M Akram - scale.iti.kit.edu
Abstract A directed graph G=(V, E) is a difference-digraph if there exists a labelling⁄: V 'æ Z
such that the arc (v, w) is in E if and only if there exists az œ V with⁄(v)≠⁄(w)=⁄(z). An …
such that the arc (v, w) is in E if and only if there exists az œ V with⁄(v)≠⁄(w)=⁄(z). An …