A Note on the Sum $\sum 1/w_{k 2^n}$
نویسندگان
چکیده
منابع مشابه
A Note on Chromatic Sum
The chromatic sum Σ(G) of a graph G is the smallest sum of colors among of proper coloring with the natural number. In this paper, we introduce a necessary condition for the existence of graph homomorphisms. Also, we present Σ(G) < χf (G)|G| for every graph G.
متن کاملA Note on the Block Sum Transformation
In a recent paper, Bourchard et al. [1] proposed the block sum transformation, a method intended as an alternative to the discrete Fourier transform (DFT), with application to the analysis of excited vibrations of linear systems. In this note, we mention the existence of a number of alternative algorithms for the computation of the DFT, and show that the block sum transformation is equivalent t...
متن کاملNote on a Zero-Sum Problem
Let G be an additively written, finite abelian group, and exp(G ) its exponent. Let S=(a1 , ..., ak) be a sequence of elements in G; we say that S is a zero-sum sequence if i=1 ai=0. Let s(G ) be the samllest integer t such that every sequence of t elements in G contains a zero-sum subsequence of length exp(G ). This constant has been studied by serveral authors during last 20 years [1 9, 11]. ...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملA note on polyomino chains with extremum general sum-connectivity index
The general sum-connectivity index of a graph $G$ is defined as $chi_{alpha}(G)= sum_{uvin E(G)} (d_u + d_{v})^{alpha}$ where $d_{u}$ is degree of the vertex $uin V(G)$, $alpha$ is a real number different from $0$ and $uv$ is the edge connecting the vertices $u,v$. In this note, the problem of characterizing the graphs having extremum $chi_{alpha}$ values from a certain collection of polyomino ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Missouri Journal of Mathematical Sciences
سال: 1998
ISSN: 0899-6180
DOI: 10.35834/1998/1003141