نتایج جستجو برای: sum graphs

تعداد نتایج: 172158  

Journal: :Theor. Comput. Sci. 2012
Allan Borodin Ioana Ivan Yuli Ye Bryce Zimny

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 ...

Journal: :International Journal of Mathematics and Mathematical Sciences 1994

Journal: :Discrete Mathematics 2001

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 ...

The forgotten topological index is defined as sum of third power of degrees. In this paper, we compute some properties of forgotten index and then we determine it for some classes of product graphs.

Journal: :Graphs and Combinatorics 2022

For a complete graph $$K_n$$ of order n, an edge-labeling $$c:E(K_n)\rightarrow \{ -1,1\}$$ satisfying $$c(E(K_n))=0$$ , and spanning forest F we consider the problem to minimize $$|c(E(F'))|$$ over all isomorphic copies $$F'$$ in . In particular, ask under which additional conditions there is zero-sum copy, that is, copy with $$c(E(F'))=0$$ We show always $$|c(E(F'))|\le \Delta (F)+1$$ where $...

Journal: :Electronic Notes in Discrete Mathematics 2002
Zhibo Chen

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 node of G is called a saturated node if it is adjacent to every other node of G. We show that any integral sum graph which is not K3 has at most two saturated ...

Journal: :Discrete Mathematics 2002
Leonid S. Melnikov Artem V. Pyatkin

Given a set of integers S; G(S) = (S; E) is a graph, where the edge uv exists if and only if u+ v∈ S. A graph G = (V; E) is an integral sum graph or ISG if there exists a set S ⊂ Z such that G=G(S). This set is called a labeling of G. The main results of this paper concern regular ISGs. It is proved that all 2-regular graphs with the exception of C4 are integral sum graphs and that for every po...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید