相关论文: The Double Star Sequences and the General Second Z…

Topological relations between three degree-based invariants of a connected graph G are investigated. We present novel inequalities including M1(G), M2(G) and F(G), and show that in all cases equality holds if G is a regular or a semiregular…

A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…

We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…

This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…

Let $B$ be an equivalence relation defined on a finite group $G$. The $B$ super commuting graph on $G$ is a graph whose vertex set is $G$ and two distinct vertices $g$ and $h$ are adjacent if either $[g] = [h]$ or there exist $g' \in [g]$…

A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence $(k_1+ 1, k_2+ 1, 1, \ldots, 1)$ is denoted by $S_{k_1, k_2}$. We study the edge-decomposition of regular graphs into…

Let $\Gamma$ be a finite graph and let $\Gamma^{\mathrm{e}}$ be its extension graph. We inductively define a sequence $\{\Gamma_i\}$ of finite induced subgraphs of $\Gamma^{\mathrm{e}}$ through successive applications of an operation called…

We study the joint distribution of descents and inverse descents over the set of permutations of n letters. Gessel conjectured that the two-variable generating function of this distribution can be expanded in a given basis with nonnegative…

Let G be a simple connected molecular graph with vertex set $V(G)$ and edge set $E(G)$. One important modification of classical Zagreb index, called hyper Zagreb index $HM(G)$ is defined as the sum of squares of the degree sum of the…

Let $\prod(G)$ be Multiplicative Zagreb index of a graph G. A connected graph is a cactus graph if and only if any two of its cycles have at most one vertex in common, which has been the interest of researchers in the filed of material…

Using a direct algebraic approach we derive convolution identities for second order sequences, hereby distinguishing between sequences obeying the same or different recurrence relations. We also state a general convolution for Horadam…

Let $G = (V, E)$ be a graph. The first Zagreb index of a graph $G$ is defined as $\sum_{u \in V} d^2(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. Using the P\'{o}lya-Szeg\H{o} inequality, we in this paper present the first Zagreb…

The Szeged index of a graph is an invariant with several applications in chemistry. The power graph of a finite group $G$ is a graph having vertex set as $G$ in which two vertices $u$ and $v$ are adjacent if $v=u^m$ or $u=v^n$ for some…

For a (molecular) graph, the first multiplicative Zagreb index $\prod_1(G) $ is the product of the square of every vertex degree, and the second multiplicative Zagreb index $\prod_2(G) $ is the product of the products of degrees of pairs of…

We introduce a new generalization of Stirling numbers of the second kind and analyze their properties, including generating functions, integral representations, and recurrence relations. These numbers are used to approximate Riemann zeta…

The Stern diatomic sequence is closely linked to continued fractions via the Gauss map on the unit interval, which in turn can be understood via systematic subdivisions of the unit interval. Higher dimensional analogues of continued…

Sequences of Genocchi numbers of the first and second kind are considered. For these numbers, an approach based on their representation using sequences of polynomials is developed. Based on this approach, for these numbers some identities…

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…

A 2-factor of a graph $G$ is a 2-regular spanning subgraph of $G$. We present a survey summarising results on the structure of 2-factors in regular graphs, as achieved by various researchers in recent years.

The sum formulas for multiple zeta(-star) values and symmetric multiple zeta(-star) values bear a striking resemblance. We explain the resemblance in a rather straightforward manner using an identity that involves the Schur multiple zeta…