Sum graphs over all the integers
Proceedings of the first Malta conference on Graphs and combinatorics
Discrete Mathematics
New types of integral sum graphs
Discrete Mathematics
Algorithms for computing parameters of graph-based extensions of BCH codes
Journal of Discrete Algorithms
A new model for classifying DNA code inspired by neural networks and FSA
PKAW'06 Proceedings of the 9th Pacific Rim Knowledge Acquisition international conference on Advances in Knowledge Acquisition and Management
Hi-index | 0.00 |
A mapping L is called a sum labeling of a graph H(V(H),E(H)) if it is an injection from V(H) to a set of positive integers, such that xy ∈ E(H) if and only if there exists a vertex w ∈ V(H) such that L(w) = L(x) + L(y). In this case, w is called a working vertex. We define L as an exclusive sum labeling of a graph G if it is a sum labeling of $G\cup\bar K_{r}$ for some non negative integer r, and G contains no working vertex. In general, a graph G will require some isolated vertices to be labeled exclusively. The least possible number of such isolated vertices is called exclusive sum number of G; denoted by ε(G). An exclusive sum labeling of a graph G is said to be optimum if it labels G exclusively by using ε(G) isolated vertices. In case ε (G) = Δ (G), where Δ(G) denotes the maximum degree of vertices in G, the labeling is called Δ-optimum exclusive sum labeling. In this paper we present Δ-optimum exclusive sum labeling of certain graphs with radius one, that is, graphs which can be obtained by joining all vertices of an integral sum graph to another vertex. This class of graphs contains infinetely many graphs including some populer graphs such as wheels, fans, friendship graphs, generalised friendship graphs and multicone graphs.