A graph is called a sum graph if its vertices can be labelled by distinct positive integers such
that there is an edge between two vertices if and only if the sum of their labels is the label of …

All sum graphs are disconnected. In order for a connected graph to bear a sum labeling, the
graph is considered in conjunction with a number of isolated vertices, the labels of which …

This paper introduces a new model of classifiers CL (V, E, ℓ, r) designed for classifying DNA
sequences and combining the flexibility of neural networks and the generality of finite state …

Algorithms for computing parameters of graph-based extensions of BCH codes - ScienceDirect
Skip to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in …

The notions of sum labeling and sum graph were introduced by Harary in 1990 3]. In a sum
labeling, a vertex is called a working verter if its label is equal to the sum of the labels of a …

Some Open Problems on Graph Labelings Page 1 AKCE J. Graphs. Combin., 6, No. 1 (2009),
pp. 229-236 Some Open Problems on Graph Labelings S. Arumugam Core Group …

Let G be a nonempty simple graph with a vertex set V (G) and an edge set E (G). For every
injective vertex labeling f: V (G)→ Z, there are two induced edge labelings, namely f+: E …

We generalize the concept of exclusive sum labelings of graphs (cf. Miller et al., JCMCC 55:
137–148, 2005) and determine the exclusive sum number for several classes of …

The thesis mainly involves the study of graph labelings and graph spectra with a focus on
their applications. Labeled graphs provide a compact representation in which each element …

Graph labeling deals with assigning labels to one or more elements of a graph. It has a wide
variety of applications including: coding theory, communication network addressing, data …