相关论文: Some results on generalized strong external differ…

In this paper, we show that for any positive integer $m$ and $k\in [2]$, let $G$ be a $(2m+2k+2)$-connected graph and let $a_1,\ldots , a_m, s, t$ be any distinct vertices of $G$, there are $k$ internally disjoint $s$-$t$ paths $P_1,…

In matrix theory and numerical analysis there are two very famous and important results. One is Gersgorin circle theorem, the other is strictly diagonally dominant theorem. They have important application and research value, and have been…

We approach the Generalized Beta (GB) family of distributions using a mean-reverting stochastic differential equation (SDE) for a power of the variable, whose steady-state (stationary) probability density function (PDF) is a modified GB…

In this paper, we investigate a variant of Ramsey numbers called defective Ramsey numbers where cliques and independent sets are generalized to $k$-dense and $k$-sparse sets, both commonly called $k$-defective sets. We focus on the…

Bollob\'as and Nikiforov [J. Combin. Theory, Ser. B. 97 (2007) 859--865] conjectured the following. If $G$ is a $K_{r+1}$-free graph on at least $r+1$ vertices and $m$ edges, then $\lambda^2_1(G)+\lambda^2_2(G)\leq \frac{r-1}{r}\cdot2m$,…

Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…

Let $\mathcal{G} = \{G_1 = (V, E_1), \dots, G_m = (V, E_m)\}$ be a collection of $m$ graphs defined on a common set of vertices $V$ but with different edge sets $E_1, \dots, E_m$. Informally, a function $f :V \rightarrow \mathbb{R}$ is…

Based on a result of Makeev, in 2012 Blagojevi\'c and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=\Delta(m;\ell/k)$ such that for any $m$ mass distributions…

Erd\H{o}s, F\"uredi, Rothschild and S\'os initiated a study of classes of graphs that forbid every induced subgraph on a given number $m$ of vertices and number $f$ of edges. Extending their notation to $r$-graphs, we write $(n,e) \to_r…

In this paper we prove several results on Ramsey numbers $R(H,F)$ for a fixed graph $H$ and a large graph $F$, in particular for $F = K_n$. These results extend earlier work of Erd\H{o}s, Faudree, Rousseau and Schelp and of Balister, Schelp…

Fix $m \in \mathbb N$. A new generalization of the $H$-join operation of a family of graphs $\{G_1, G_2, \dots, G_k\}$ constrained by indexing maps $I_1,I_2,\dots,I_k$ is introduced as $H_m$-join of graphs, where the maps $I_i:V(G_i)$ to…

Given integers $m$ and $f$, let $S_n(m,f)$ consist of all integers $e$ such that every $n$-vertex graph with $e$ edges contains an $m$-vertex induced subgraph with $f$ edges, and let $\sigma(m,f)=\limsup_{n\rightarrow\infty}…

Let $G$ be a graph and let $S(G)$, $M(G)$, and $T(G)$ be the subdivision, the middle, and the total graph of $G$, respectively. Let ${\rm dim}(G)$, ${\rm edim}(G)$, and ${\rm mdim}(G)$ be the metric dimension, the edge metric dimension, and…

We provide a classification of graphical models according to their representation as subfamilies of exponential families. Undirected graphical models with no hidden variables are linear exponential families (LEFs), directed acyclic…

Similar to the generalized extreme value (GEV) family, the generalized extreme value distributions under power normalization are introduced by Roudsari (1999) and Barakat et al. (2013). In this article, we study the asymptotic behavior of…

The existence of a full strong exceptional sequence in the derived category of a smooth quadric hypersurface was proved by Kapranov. In this paper, we present a skew generalization of this result. Namely, we show that if $S$ is a standard…

In this paper, we show that every highly edge-connected graph $G$, under a necessary and sufficient degree condition, can be edge-decomposed into $k$ factors $G_1,\ldots, G_k$ such that for each vertex $v\in V(G_i)$ with $1\le i\le k$,…

Nambu-determinant brackets on $R^d\ni x=(x^1,...,x^d)$, $\{f,g\}_d(x)=\rho(x) \det(\partial(f,g,a_1,...,a_{d-2})/\partial(x^1,...,x^d))$, with $a_i\in C^\infty(R^d)$ and $\rho\partial_x\in\mathfrak{X}^d(R^d)$, are a class of Poisson…

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. It is natural to introduce the concept of generalized $k$-edge-connectivity $\lambda_k(G)$. For general $k$, the generalized…

If a regular graph of degree $k$ and diameter $d$ has $v$ vertices then $$v\le 1+k+k(k-1)+\dots+k(k-1)^{d-1}.$$ Graphs with $v=1+k+k(k-1)+\dots+k(k-1)^{d-1}$ are called Moore graphs. Damerell proved that a Moore graph of degree $k\ge 3$ has…