نتایج جستجو برای: order difference interval graph
تعداد نتایج: 1611404 فیلتر نتایج به سال:
we investigate the long-term behavior of solutions of the difference equation[ x_{n+1}=x_{n}x_{n-3}-1 ,, n=0 ,, 1 ,, ldots ,, ]noindent where the initial conditions $x_{-3} ,, x_{-2} ,, x_{-1} ,, x_{0}$ are real numbers. in particular, we look at the periodicity and asymptotic periodicity of solutions, as well as the existence of unbounded solutions.
The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this graph. Also we give a relation between the order graph and prime graph of a group.
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
A graph is balanced if its clique-vertex incidence matrix is balanced, i.e., it does not contain a square submatrix of odd order with exactly two ones per row and per column. Interval graphs, obtained as intersection graphs of intervals of a line, are well-known examples of balanced graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. Circular-arc graphs gener...
We survey the all-interval chords of small order and the interval systems in which they are situated. We begin with an examination of traditional all-interval chords in chromatic pitch-class spaces, and extend the notion of their structure to their counterparts in David Lewin’s Generalized Interval Systems. Mathematically, we observe that these chords belong to three categories of difference se...
the purpose of the present study was to investigate the effect of task-based instruction of vocabulary on the receptive and oral productive acquisition of english vocabulary and compare the results with those obtained from the traditional method. the method and procedure applied in this study was as follows: after the implementation of opt, a group of sixty female students were chosen. the stu...
Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...
the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید