In this paper we discuss cordial labeling in the context of arbitrary supersubdivision of graph. We prove that the graphs obtained by arbitrary supersubdivision of path as well as star admit cordial labeling. In addition to this we prove that the graph obtained by arbitrary supersubdivision of cycle is cordial except when n and all mi are simultaneously odd numbers. Mathematics Subject Classifi...

For example is a chromatic number with the smallest integer so that graph has true vertex coloring k color. Chromatic still an interesting study which being studied for its development through coloring. Graph special case of labeling. Labeling here means, giving color to points at certain limit no two vertices have same This aims calculate in several classes graphs including , Based on results ...

Using the theory of o-minimality we show that the p-adic method of Skolem-Mahler-Lech-Chabauty may be adapted to prove instances of the dynamical Mordell-Lang conjecture for some real analytic dynamical systems. For example, we show that if f1, . . . , fn is a finite sequence of real analytic functions fi : (−1, 1)→ (−1, 1) for which fi(0) = 0 and | f ′ i (0)| ≤ 1 (possibly zero), a = (a1, . . ...

The subject of this note is a challenging conjecture about X-rays of permutations which is a special case of a conjecture regarding Skolem sequences. In relation to this, Brualdi and Fritscher [Linear Algebra and its Applications, 2014] posed the following problem: Determine a bijection between extremal Skolem sets and binary Hankel X-rays of permutation matrices. We give such a bijection, alon...