THE ENTIRE FACE IRREGULARITY STRENGTH OF A BOOK WITH POLYGONAL PAGES

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irregularity strength of digraphs

It is an elementary exercise to show that any non-trivial simple graph has two vertices with the same degree. This is not the case for digraphs and multigraphs. We consider generating irregular digraphs from arbitrary digraphs by adding multiple arcs. To this end, we define an irregular labeling of a digraph D to be an arc labeling of the digraph such that the ordered pairs of the sums of the i...

متن کامل

the effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)

cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...

On graph irregularity strength

An assignment of positive integer weights to the edges of a simple graph G is called irregular, if the weighted degrees of the vertices are all different. The irregularity strength, s(G), is the maximal weight, minimized over all irregular assignments. In this study, we show that s(G) c1 n / , for graphs with maximum degree n and minimum

متن کامل

Irregularity strength of dense graphs

Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) → {1, 2, . . . , w}. For a vertex v, f(v) is defined as the sum f(e) over all edges e of G incident with v. f is called irregular, if all f(v) are distinct. The smallest w for which there exists an irregular assignment on G is called the irreg...

متن کامل

Irregularity Strength of Regular Graphs

Let G be a simple graph with no isolated edges and at most one isolated vertex. For a positive integer w, a w-weighting of G is a map f : E(G) → {1, 2, . . . , w}. An irregularity strength of G, s(G), is the smallest w such that there is a w-weighting of G for which ∑

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BAREKENG: Jurnal Ilmu Matematika dan Terapan

سال: 2015

ISSN: 2615-3017,1978-7227

DOI: 10.30598/barekengvol9iss2pp103-108