相关论文: General position sets, colinear sets, and Sierpi\'…

We prove a prime number theorem first for the classical Rankin-Selberg L-function $L(s,\pi\times\pi')$ over any Galois extension with $\pi$ and $\pi'$ unitary automorphic cuspidal representations of $GL_n$ and $GL_m$ respectively with at…

In a group $G$, a weak Sierpi\'nski subset is a subset $E$ such that for some $g,h\in G$ and $a\neq b\in E$, we have $gE=E\smallsetminus \{a\}$ and $hE=E\smallsetminus \{b\}$. In this setting, we study the subgroup generated by $g$ and $h$,…

Let $\mathcal{F}$ be a family of graphs. A graph is called $\mathcal{F}$-free if it does not contain any member of $\mathcal{F}$. Generalized Tur\'{a}n problems aim to maximize the number of copies of a graph $H$ in an $n$-vertex…

Sierpinski's Hypothesis H1, formulated in 1958, is the conjecture that (provided $n\geq 2$), when the first $n^2$ counting numbers, $1, 2,3,\dots n^2$, are arranged in a square, then each row contains at least one prime. This conjecture is…

For $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total (distance) $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than…

Two vertices u,v of connected graph G are doubly resolved by x,y\in V(G)if d(v; x)-d(u; x)\neq d(v; y)-d(u; y): A set W of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by…

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

The \emph{regular independence number}, introduced by Albertson and Boutin in 1990, is the maximum cardinality of an independent set of $G$ in which all vertices have equal degree in $G$. Recently, Caro, Hansberg and Pepper introduced the…

Let $G(V,E)$ be a finite, simple, isolate-free graph. Two disjoint sets $A,B\subset V$ form a total coalition in $G$, if none of them is a total dominating set, but their union $A\cup B$ is a total dominating set. A vertex partition…

A general position set S is a set S of vertices in G(V,E) such that no three vertices of S lie on a shortest path in G. Such a set of maximum size in G is called a gpset of G and its cardinality is called the gp-number of G denoted by…

For a graph $G$, a vertex subset $S$ is called a maximum generalized $k$-independent set if the induced subgraph $G[S]$ does not contain a $k$-tree as its subgraph, and the subset has maximum cardinality. The generalized $k$-independence…

Let $P\in\mathbb{P}_1(\mathbb{Q})$ be a periodic point for a monic polynomial with coefficients in $\mathbb{Z}$. With elementary techniques one sees that the minimal periodicity of $P$ is at most $2$. Recently we proved a generalization of…

A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…

We consider the cubic and quintic Gross-Pitaevskii (GP) hierarchies in $d$ dimensions, for focusing and defocusing interactions. We introduce new higher order energy functionals and prove that they are conserved for solutions of energy…

To each finite frame $\varphi$ in an inner product space $\mathcal{H}$ we associate a simple graph $G(\varphi)$, called {\it frame graph}, with the vectors of the frame as vertices and there is an edge between vertices $f$ and $g$ provided…

A sequence $S=(v_1,\ldots,v_k)$ of distinct vertices of a graph $G$ is called a legal sequence if $N[v_i] \setminus \cup_{j=1}^{i-1}N[v_j]\not=\emptyset$ for any $i$. The maximum length of a legal (dominating) sequence in $G$ is called the…

In a previous work joint with Dai and Luo, we show that a connected generalized Sierpi\'nski carpet (or shortly a GSC) has cut points if and only if the associated $n$-th Hata graph has a long tail for all $n\geq 2$. In this paper, we…

Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…

For any graph G = (V, E) and proportion $p\in(0,1]$, a set $S\subseteq V$ is a p-dominating set if $\frac{|N[S]|}{|V|}\geq p$. The $p$-domination number $\gamma_{p}(G)$ equals the minimum cardinality of a $p$-dominating set in G. For a…

A dominating set of a graph $G=(V,E)$ is a vertex set $D$ such that every vertex in $V(G) \setminus D$ is adjacent to a vertex in $D$. The cardinality of a smallest dominating set of $D$ is called the domination number of $G$ and is denoted…