‎we mainly discuss the existence of meromorphic (entire) solutions of‎ ‎certain type of non-linear difference equation of the form‎: ‎$f(z)^m+p(z)f(z+c)^n=q(z)$‎, ‎which is a supplement of previous‎ ‎results in [k‎. ‎liu‎, ‎l. z‎. ‎yang and x‎. ‎l‎. ‎liu‎, ‎existence of entire solutions of nonlinear difference‎ ‎equations‎, ‎czechoslovak math. j. 61 (2011)‎, no. 2, ‎565--576‎, and x‎. ‎g‎. ‎qi‎...

For an interval graph with some additional order constraints between pairs of non-intersecting intervals, we give a linear time algorithm to determine if there exists a realization which respects the order constraints. Previous algorithms for this problem (known also as seriation with side constraints) required quadratic time. This problem contains as subproblems interval graph and interval ord...

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

A connected domination set of a graph is a set of vertices such that every vertex not in is adjacent to and the induced subgraph of is connected. The minimum connected domination set of a graph is the connected domination set with the minimum number of vertices. In this paper, we propose parallel algorithms for finding the minimum connected domination set of interval graphs and circular-arc gra...

the average distance of a vertex $v$ of a connected graph $g$is the arithmetic mean of the distances from $v$ to allother vertices of $g$. the proximity $pi(g)$ and the remoteness $rho(g)$of $g$ are defined as the minimum and maximum averagedistance of the vertices of $g$. in this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...

in this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. let g = (v,e) be a graph with p vertices and q edges. g is said be skolem odd difference mean if there exists a function f : v (g) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : e(g) → {1, 3, 5, . . . , 2q−1} d...

In this paper we introduce abstract string modules and give an explicit bijection between the submodule lattice of module perfect matching corresponding snake graph. particular, make direct correspondence a For every define Coxeter element in symmetric group. We then establish given by interval weak Bruhat order determined element. Using graphs, new concise formulation graph calculus.