We present an approach to find the edge congestion sum and dilation sum forembedding of square of cycle on n vertices, Cn , and Cn 2 −1 + K1 into arbitrary tree. The embedding algorithms use a technique based on consecutive label property. Our algorithm calculates edge congestion in linear time.

We consider the sum coloring (chromatic sum) and sum multi-coloring problems for restricted families of graphs. In particular, we consider the graph classes of proper intersection graphs of axis-parallel rectangles, proper interval graphs, and unit disk graphs. All the above mentioned graph classes belong to a more general graph class of (k+1)clawfree graphs (respectively, for k = 4, 2, 5). We ...

The idea of integral sum graphs was introduced by Harary (1994). A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f(u) + f(v) = f(w) for some node w in G. A tree is said to be a generalized star if it can be obtained from a star by extending each edge to...

For graphs G and H, let G ⊕ H denote their Cartesian sum. We investigate the chromatic number and the circular chromatic number for G ⊕ H. It is proved that for any graphs G and H, χ(G ⊕ H) ≤ max{dχc(G)χ(H)e, dχ(G)χc(H)e}. It is conjectured that for any graphs G and H, χc(G ⊕H) ≤ max{χ(H)χc(G), χ(G)χc(H)}. We confirm this conjecture for graphs G and H with special values of χc(G) and χc(H). The...

A set S  V is a induced -paired dominating set if S is a dominating set of G and the induced subgraph is a perfect matching. The induced paired domination number ip(G) is the minimum cardinality taken over all paired dominating sets in G. The minimum number of colours required to colour all the vertices so that adjacent vertices do not receive the same colour and is denoted by (G). The a...

We introduce the Laplacian sum-eccentricity matrix LS_e} of a graph G, and its Laplacian sum-eccentricity energy LS_eE=sum_{i=1}^n |eta_i|, where eta_i=zeta_i-frac{2m}{n} and where zeta_1,zeta_2,ldots,zeta_n are the eigenvalues of LS_e}. Upper bounds for LS_eE are obtained. A graph is said to be twinenergetic if sum_{i=1}^n |eta_i|=sum_{i=1}^n |zeta_i|. Conditions ...

Abstract: In this paper, with the help of the Hardy and Dedekind sums we will give many properties of the sum B1(h, k), which was defined by Cetin et al. Then we will give the connections of this sum with the other well-known finite sums such as the Dedekind sums, the Hardy sums, the Simsek sums Y(h, k) and the sum C1(h, k). By using the Fibonacci numbers and two-term polynomial relation, we wi...

We present a tight bound on the exact maximum complexity of Minkowski sums of polytopes in R. In particular, we prove that the maximum number of facets of the Minkowski sum of k polytopes with m1,m2, . . . ,mk facets respectively is bounded from above by