Rank numbers for bent ladders
نویسندگان
چکیده
A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices with the same label contains a vertex with a larger label. The rank number of a graph is the fewest number of labels that can be used in a ranking. The rank number of a graph is known for many families, including the ladder graph P2 × Pn. We consider how ”bending” a ladder affects the rank number. We prove that in certain cases the rank number does not change, and in others the rank number differs by only 1. We investigate the rank number of a ladder with an arbitrary number of bends.
منابع مشابه
The Non-Linear Sigma Model and Spin Ladders
The well known Haldane map from spin chains into the O(3) non linear sigma model is generalized to the case of spin ladders. This map allows us to explain the different qualitative behaviour between even and odd ladders, exactly in the same way it explains the difference between integer and half-integer spin chains. Namely, for even ladders the topological term in the sigma model action is abse...
متن کاملNonlinear sigma model of a spin ladder containing a static single hole
In this letter we extend the nonlinear σ model describing pure spin ladders with an arbitrary number of legs to the case of ladders containing a single static hole. A simple immediate application of this approach to classical ladders is worked out. PACS numbers: 75.50.Ee; 75.10.Jm; 75.10.Hk; 75.30.Ds
متن کاملCrossed ladders and power means ∗
Given to positive numbers a and b, we show how we easily can construct the power mean Pk(a, b) of order k for the cases k = −2, −1, −1/2, 0, 1/2, 1 and 2. This is done by observing that the power means correspond to certain distances in the crossed ladders problem. The so-called crossed ladders problem, of unknown origin, has been discussed in the literature at least since 1895 (see [3, p. 62-6...
متن کاملUpper bounds on the numbers of resilient functions and of bent functions
Bent and resilient functions play significant roles in cryptography, coding theory, and combinatorics. However, the numbers of bent and resilient functions on a given number of variables are not known. Even a reasonable bound on the number of bent functions is not known and the best known bound on the number of resilient functions seems weak for functions of high orders. In this paper we presen...
متن کاملInterval Edge Colorings of Mobius Ladders
An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex x are colored by d_{G}(x) consecutive colors, where d_{G}(x) is the degree of the vertex x in G. For Mobius ladders the existence of this coloring is proved and all possible numbers of colors in su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 2014