相关论文: On the Index of Diffie-Hellman Mapping

We consider a class $G(S^n)$ of orientation preserving Morse-Smale diffeomorphisms of the sphere $S^{n}$ of dimension $n>3$ in assumption that invariant manifolds of different saddle periodic points have no intersection. We put in a…

Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$-regular $n$-vertex graph $G$ whose second largest eigenvalue in…

The general Sombor index of $G$ is defined as $SO_{\alpha}(G)= \sum_{uv\in G}\left(d^2_{G}(u)+d^2_{G}(v)\right)^{\alpha}$. For $0<\alpha<1$, we have the upper bound of $SO_{\alpha}(G)$ on unicyclic graphs with a fixed diameter, and the…

For a closed Riemannian manifold $M^{n+1}$ with a compact Lie group $G$ acting as isometries, the equivariant min-max theory gives the existence and the potential abundance of minimal $G$-invariant hypersurfaces provided $3\leq {\rm…

In this note we give an explicit geometric description of some of the Nakajima's quiver varieties. More precisely, we show that the $\Gamma$-equivariant Hilbert scheme $X^{\Gamma[n]}$ and the Hilbert scheme $X_\Gamma^{[n]}$ (where $X=\C^2$,…

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…

The integral circulant graph $ICG_n (D)$ has the vertex set $Z_n = \{0, 1, 2, \ldots, n - 1\}$, where vertices $a$ and $b$ are adjacent if $\gcd(a-b,n)\in D$, with $D \subseteq \{d : d \mid n,\ 1\leq d<n\}$. In this paper, we establish that…

Let $X$ be bipartite mixed graph and for a unit complex number $\alpha$, $H_\alpha$ be its $\alpha$-hermitian adjacency matrix. If $X$ has a unique perfect matching, then $H_\alpha$ has a hermitian inverse $H_\alpha^{-1}$. In this paper we…

In this paper, we introduce a weakening of the Freiman isomorphisms between subsets of non necessarily abelian groups. Inspired by the breakthrough result of Kravitz, [14], on cyclic groups, as a first application, we prove that any subset…

A $c$-labeling $\phi: V(G) \rightarrow \{1, 2, \hdots, c \}$ of graph $G$ is distinguishing if, for every non-trivial automorphism $\pi$ of $G$, there is some vertex $v$ so that $\phi(v) \neq \phi(\pi(v))$. The distinguishing number of $G$,…

We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just…

Let G be a simple graph with vertex set V(G). A subset S of V(G) is independent if no two vertices from S are adjacent. The graph G is known to be a Konig-Egervary if alpha(G) + mu(G)= |V(G)|, where alpha(G) denotes the size of a maximum…

The 2-domination number $\gamma_2(G)$ of a graph $G$ is the minimum cardinality of a set $ D \subseteq V(G) $ for which every vertex outside $ D $ is adjacent to at least two vertices in $ D $. Clearly, $ \gamma_2(G) $ cannot be smaller…

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

Let $G=C_{p^n}$ be a finite cyclic p-group, and let $Hol(G)$ denote its holomorph. In this work, we find and characterize the regular subgroups of $Hol(G)$ that are mutually normalizing each other in the permutation group $Sym(G)$. We…

The Harborth constant of a finite group $G$ is the smallest integer $k\geq \exp(G)$ such that any subset of $G$ of size $k$ contains $\exp(G)$ distinct elements whose product is $1$. Generalizing previous work on the Harborth constants of…

For a graph $G$ with edge set $E$, let $d(u)$ denote the degree of a vertex $u$ in $G$. The diminished Sombor (DSO) index of $G$ is defined as $DSO(G)=\sum_{uv\in E}\sqrt{(d(u))^2+(d(v))^2}(d(u)+d(v))^{-1}$. The cyclomatic number of a graph…

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. In this paper, we investigate…

Cohen et al. conjectured that for every oriented cycle $C$ there exist an integer $f(C)$ such that every strong $f(C)$-chromatic digraph contains a subdivision of $C$. El Joubbeh confirmed this conjecture for Hamiltonian digraphs. Indeed,…

Let $\Gamma$ be a chart. For each label $m$, we denote by $\Gamma_m$ the "subgraph" of $\Gamma$ consisting of all the edges of label $m$ and their vertices. Let $\Gamma$ be a minimal chart of type $(m;3,3)$. That is, a minimal chart…