The neighborhood polynomial of graph $G$, denoted by $N(G,x)$, is the generating function for the number of vertex subsets of $G$ which are subsets of open neighborhoods of vertices in $G$. For any graph polynomial, it can be useful to generate a new family of polynomials by introducing some restrictions and characterizations. In this paper, we investigate two new graph polynomials that are obtained from $N(G,x)$ by adding independence or connectivity restrictions to the vertex subsets or to the subgraphs induced by the vertex subsets which are generated by $N(G,x)$. These new polynomials are not only related to $N(G,x)$, but also having strong connections to other known graph polynomials of G or its subgraphs, such as independence polynomials or subgraph component polynomials.
The neighborhood polynomial of graph $G$ is the generating function for the number of vertex subsets of $G$ of which the vertices have a common neighbor in $G$. In this paper, we investigate the behavior of this polynomial under several graph operations. Specifically, we provide an explicit formula for the neighborhood polynomial of the graph obtained from a given graph $G$ by vertex attachment. We use this result to propose a recursive algorithm for the calculation of the neighborhood polynomial. Finally, we prove that the neighborhood polynomial can be found in polynomial-time in the class o…
In this short note, we give a new sufficient condition for the existence of long cycles in graphs involving Fan-type degree condition and neighborhood intersection.
A fall coloring of a graph G is a proper coloring of G with k colors such that each vertex sees all k colors on its closed neighborhood. In this short note, we characterize all fall colorings of Kneser graphs of type KG(n,2).
In 1994, Cornelis Hoede and Xueliang Li introduced the clique polynomial of a graph. Also, a theorem for the edge subgraph expansion for clique polynomials. In this note we present a counter example for it and explain which case it could be a valid theorem.
We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco-Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial properties of the reduced rectangular plactic algebra and associated Cauchy kernels.
Buch and Rimányi proved a formula for specializations of double Grothendieck polynomials based on the Yang-Baxter equation related to the degenerate Hecke algebra. A geometric proof was found by Yong and Woo by constructing a Gröbner basis for the Kazhdan-Lusztig ideals. In this note, we give an elementary proof for this formula by using only divided difference operators.
Given a graph, the conflict-free coloring problem on open neighborhoods (CFON) asks to color the vertices of the graph so that all the vertices have a uniquely colored vertex in its open neighborhood. The smallest number of colors required for such a coloring is called the conflict-free chromatic number and denoted $χ_{ON}(G)$. In this note, we study this problem on $S_k$-free graphs where $S_k$ is a star on $k+1$ vertices. When $G$ is $S_k$-free, we show that $χ_{ON}(G) = O(k\cdot \log^{2+ε}Δ)$, for any $ε> 0$, where $Δ$ denotes the maximum degree of $G$. Further, we show existence of claw-fr…
We briefly explore a sequence that came up in recent work of Tirrell and Zhuang. We discover an unusual phenomenon where the sequence appears at first to have periodic behavior but eventually has non-periodic fluctuations.
Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, two conjectures on permutation polynomials proposed recently by Wu and Li [19] are settled. Moreover, a new class of permutation trinomials of the form $x+γ\textup{Tr}_{q^n/q}(x^k)$ is also presented, which generalizes two examples of [10].
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope still has the property that each coefficient is the normalized volume of a projection of the original polytope. Furthermore, we show that the new family of lattice-face polytopes contains all possible combinatorial types of rational polytopes.
Even-hole-free graphs are a graph class of much interest. Foley et al. [Graphs Comb. 36(1): 125-138 (2020)] have recently studied $(4K_1, C_4, C_6)$-free graphs, which form a subclass of even-hole-free graphs. Specifically, Foley et al. have shown an algorithm for coloring these graphs via bounded clique-width if they contain a $C_7$. In this note, we give a simpler and much faster algorithm via a more restrictive graph parameter, neighborhood diversity.
In [M. M. Kanté, V. Limouzy, A. Mary, and L. Nourine. On the enumeration of minimal dominating sets and related notions. SIAM Journal on Discrete Mathematics, 28(4):1916-1929, 2014] the authors give an $O(n+m)$ delay algorithm based on neighborhood inclusions for the enumeration of minimal dominating sets in split and $P_6$-free chordal graphs. In this paper, we investigate generalizations of this technique to $P_k$-free chordal graphs for larger integers $k$. In particular, we give $O(n+m)$ and $O(n^3\cdot m)$ delays algorithms in the classes of $P_7$-free and $P_8$-free chordal graphs. As fo…
We investigate the Stern polynomials defined by $B_0 ( t ) =0,B_1 ( t ) =1$, and for $n \geq 2$ by the recurrence relations $B_{2n}( t) =tB_{n}( t) ,$ $B_{2n+1}( t) =B_n( t) +B_{n+1}( t) $. We prove that all possible rational roots of that polynomials are $0,-1,-1/2,-1/3$. We give complete characterization of $n$ such that $deg( B_n) = deg( B_{n+1}) $ and $deg( B_n) =deg( B_{n+1}) =deg( B_{n+2}) $. Moreover, we present some result concerning reciprocal Stern polynomials.
We address questions posed by Lorenzini about relations between Jacobians, Tutte polynomials, and the Brill-Noether theory of finite graphs, as encoded in his two-variable zeta functions. In particular, we give examples showing that none of these invariants is determined by the other two.
Let $(X,μ,T_1,...,T_l)$ be a measure-preserving system with those $T_i$ are commuting. Suppose that the polynomials $p_1(t),...,p_{l}(t)\in\Z[t]$ with $p_j(0)=0$ have distinct degrees. Then for any $ε>0$ and $A\subseteq X$ with $μ(A)>0$, the set $$ \{n:\,μ(A\cap T_1^{-p_1(n)}A\cap...\cap T_l^{-p_l(n)}A)\geqμ(A)^{l+1}-ε\} $$ has bounded gaps.
Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results between the number of partitions of an integer $n$ whose parts are taken from the sequence $\{f(\ell)\}_{\ell=1}^{\infty}$ and the number of parts of those partitions which are in a certain arithmetic progression.
In [1] Peters and Regts confirmed a conjecture by Sokal by showing that for every $Δ\in \mathbb{Z}_{\geq 3}$ there exists a complex neighborhood of the interval $\left[0, \frac{\left(Δ- 1\right)^{Δ- 1}}{\left(Δ-2\right)^Δ}\right)$ on which the independence polynomial is nonzero for all graphs of maximum degree $Δ$. Furthermore, they gave an explicit neighborhood $U_Δ$ containing this interval on which the independence polynomial is nonzero for all finite rooted Cayley trees with branching number $Δ$. The question remained whether $U_Δ$ would be zero-free for the independence polynomial of all …
In this paper, we deduce the generalized $q$-difference equations for general Al-Salam--Carlitz polynomials and generalize Arjika's recently results [$q$-difference equation for homogeneous $q$-difference operators and their applications, J. Differ. Equ. Appl. {\bf 26}, 987--999 (2020)]. In addition, we obtain transformational identities by the method of $q$-difference equation. Moreover, we deduce $U(n+1)$ type generating functions and Ramanujan's integrals involving general Al-Salam--Carlitz polynomials by $q$-difference equation.
