We study a particular digraph dynamical system, the so called digraph diclique operator. Dicliques have frequently appeared in the literature the last years in connection with the construction and analysis of different types of networks, for instance biochemical, neural, ecological, sociological and computer networks among others. Let $D=(V,A)$ be a reflexive digraph (or network). Consider $X$ and $Y$ (not necessarily disjoint) nonempty subsets of vertices (or nodes) of $D$. A disimplex $K(X,Y)$ of $D$ is...

For any two positive integers $n$ and $k\ge 2$, let $G(n,k)$ be a digraph whose set of vertices is $\{0,1,...,n-1\}$ and such that there is a directed edge from a vertex $a$ to a vertex $b$ if $a^k\equiv b(modn)$. Let $n={\prod }_{i=1}^r{p}_i^{e_i}$ be the prime factorization of $n$. Let $P$ be the set of all primes dividing $n$ and let $P_1,P_2\subseteq P$ be such that $P_1\cup P_2=P$ and $P_1\cap P_2=\varnothing$. A fundamental constituent of $G(n,k)$, denoted by $G_{P_2}^{*}(n,k)$, is a subdigraph of $G(n,k)$ induced on the set of vertices which are multiples of ${\prod }_{p_i\in P_2}{p}_i$ and are relatively prime to all primes $q\in P_1$. L. Somer and M. Křížek proved that the trees attached...

A digraph is associated with a finite group by utilizing the power map $f:G\to G$ defined by $f\left(x\right)=x^k$ for all $x\in G$, where $k$ is a fixed natural number. It is denoted by ${\gamma }_G(n,k)$. In this paper, the generalized quaternion and $2$-groups are studied. The height structure is discussed for the generalized quaternion. The necessary and sufficient conditions on a power digraph of a $2$-group are determined for a $2$-group to be a generalized quaternion group. Further, the classification of two generated $2$-groups as abelian...

The Ramsey number $R(G,H)$ for a pair of graphs $G$ and $H$ is defined as the smallest integer $n$ such that, for any graph $F$ on $n$ vertices, either $F$ contains $G$ or $\overline{F}$ contains $H$ as a subgraph, where $\overline{F}$ denotes the complement of $F$. We study Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths and determine these numbers for some cases. We extend many known results studied in [5, 14, 18, 19, 20]. In particular we count the numbers $R(K_1+L_n,P_m)$ and $R(K_1+L_n,C_m)$ for some integers $m$, $n$, where $L_n$ is...

A real form $G$ of a complex semi-simple Lie group $G^{ℂ}$ has only finitely many orbits in any given $G^{ℂ}$-flag manifold $Z=G^{ℂ}/Q$. The complex geometry of these orbits is of interest, e.g., for the associated representation theory. The open orbits $D$ generally possess only the constant holomorphic functions, and the relevant associated geometric objects are certain positive-dimensional compact complex submanifolds of $D$ which, with very few well-understood exceptions, are parameterized by the Wolf cycle...

The heterochromatic number hc(D) of a digraph D, is the minimum integer k such that for every partition of V(D) into k classes, there is a cyclic triangle whose three vertices belong to different classes. For any two integers s and n with 1 ≤ s ≤ n, let $D_{n,s}$ be the oriented graph such that $V\left(D_{n,s}\right)$ is the set of integers mod 2n+1 and $A\left(D_{n,s}\right)=(i,j):j-i\in 1,2,...,n\setminus s..$In this paper we prove that $hc\left(D_{n,s}\right)\le 5$ for n ≥ 7. The bound is tight since equality holds when s ∈ n,[(2n+1)/3].

Following a problem posed by Lovász in 1969, it is believed that every finite connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from finite groups having a $(2,s,3)$-presentation, that is, for groups $G=\langle a,b\mid a^2=1,b^s=1,{\left(ab\right)}^3=1,\cdots \rangle$ generated by an involution $a$ and an element $b$ of order $s\ge 3$ such that their product $ab$ has order $3$. More precisely, it is shown that the Cayley graph $X=Cay(G,\{a,b,b^{-1}\})$ has a Hamilton cycle when $\left|G\right|$ (and thus $s$) is congruent to 2 modulo 4, and has a...

Let D be a finite and simple digraph with the vertex set V(D), and let f:V(D) → -1,1 be a two-valued function. If ${\sum }_{x\in N¯\left[v\right]}f\left(x\right)\ge 1$ for each v ∈ V(D), where N¯[v] consists of v and all vertices of D from which arcs go into v, then f is a signed dominating function on D. The sum f(V(D)) is called the weight w(f) of f. The minimum of weights w(f), taken over all signed dominating functions f on D, is the signed domination number ${\gamma }_S\left(D\right)$ of D. A set $f₁,f₂,...,f_d$ of signed dominating functions on D with the property that...

Let $G$ be a graph of order $n$ and $\lambda \left(G\right)$ the spectral radius of its adjacency matrix. We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in $G$. One of the main results of the paper is the following theorem: Let $k\ge 2,$ $n\ge k^3+k+4,$ and let $G$ be a graph of order $n$, with minimum degree $\delta \left(G\right)\ge k.$ If $$\lambda \left(G\right)\ge n-k-1,$$ then $G$ has a Hamiltonian cycle, unless $G=K_1\vee (K_{n-k-1}+K_k)$ or $G=K_k\vee (K_{n-2k}+{\overline{K}}_k).$

Let $G=\left(V\right(G),E(G\left)\right)$ be a simple graph and $E_G\left(v\right)$ denote the set of edges incident with a vertex $v$. A neighbor sum distinguishing (NSD) total coloring $\phi$ of $G$ is a proper total coloring of $G$ such that ${\sum }_{z\in E_G\left(u\right)\cup \left\{u\right\}}\phi \left(z\right)\ne {\sum }_{z\in E_G\left(v\right)\cup \left\{v\right\}}\phi \left(z\right)$ for each edge $uv\in E\left(G\right)$. Pilśniak and Woźniak asserted in 2015 that each graph with maximum degree $\Delta$ admits an NSD total $(\Delta +3)$-coloring. We prove that the list version of this conjecture holds for any IC-planar graph with $\Delta \ge 11$ but without $5$-cycles by applying the Combinatorial Nullstellensatz.

An edge of $G$ is singular if it does not lie on any triangle of $G$; otherwise, it is non-singular. A vertex $u$ of a graph $G$ is called locally connected if the induced subgraph $G\left[N\right(u\left)\right]$ by its neighborhood is connected; otherwise, it is called locally disconnected. In this paper, we prove that if a connected claw-free graph $G$ of order at least three satisfies the following two conditions: (i) for each locally disconnected vertex $v$ of degree at least $3$ in $G,$ there is a nonnegative integer $s$ such...

The normal cycle of a singular subset $X$ of a smooth manifold is a basic tool for understanding and computing the curvature of $X$. If $X$ is replaced by a singular function on ${ℝ}^n$ then there is a natural companion notion called the of $f$, which has been introduced by the author and by R. Jerrard. We discuss a few fundamental facts and open problems about functions $f$ that admit gradient cycles, with particular attention to the first nontrivial dimension $n=2$.

Let $(𝒮,0)$ be a germ of complex analytic normal surface. On its minimal resolution, we consider the reduced exceptional divisor $E$ and its irreducible components $E_i$, $i\in I$. The Nash map associates to each irreducible component $C_k$ of the space of arcs through $0$ on $𝒮$ the unique component of $E$ cut by the strict transform of the generic arc in $C_k$. Nash proved its injectivity and asked if it was bijective. As a particular case of our main theorem, we prove that this is the case if $E·E_i\<0$ for any $i\in I$. ...

Let $X$ be a rationally connected algebraic variety, defined over a number field $k.$ We find a relation between the arithmetic of rational points on $X$ and the arithmetic of zero-cycles. More precisely, we consider the following statements: (1) the Brauer-Manin obstruction is the only obstruction to weak approximation for $K$-rational points on $X_K$ for all finite extensions $K/k;$ (2) the Brauer-Manin obstruction is the only obstruction to weak approximation in some sense that we define for zero-cycles...

Let $G_1$ and $G_2$ be two given graphs. The Ramsey number $R(G_1,G_2)$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_1$ or $\overline{G}$ contains a $G_2$. Parsons gave a recursive formula to determine the values of $R(P_n,K_{1,m})$, where $P_n$ is a path on $n$ vertices and $K_{1,m}$ is a star on $m+1$ vertices. In this note, we study the Ramsey numbers $R(P_n,K_1\vee F_m)$, where $F_m$ is a linear forest on $m$ vertices. We determine the exact values of $R(P_n,K_1\vee F_m)$ for the cases $m\le n$ and $m\ge 2n$, and for the case that $F_m$ has no odd component. Moreover, we...

We show that if n is a positive integer and $2^{\aleph ₀}\le \aleph ₙ$, then for every positive integer m and for every real constant c > 0 there are functions $f₁,...,f_{n+m}:ℝⁿ\to ℝ$ such that $(f₁,...,f_{n+m})\left(ℝⁿ\right)={ℝ}^{n+m}$ and for every x ∈ ℝⁿ there exists a strictly increasing sequence (i₁,...,iₙ) of numbers from 1,...,n+m and a w ∈ ℤⁿ such that $(f_{i₁},...,f_{iₙ})\left(y\right)=y+w$ for $y\in x+(-c,c)\times {ℝ}^{n-1}$.

Let $ex(n,G)$ denote the maximum number of edges in a graph on $n$ vertices which does not contain $G$ as a subgraph. Let $P_i$ denote a path consisting of $i$ vertices and let $m{P}_i$ denote $m$ disjoint copies of $P_i$. In this paper we count $ex(n,3P_4)$.

Let $G$ be a finite group and let $\pi \left(G\right)=\{p_1,p_2,...,p_k\}$ be the set of prime divisors of $\left|G\right|$ for which $p_1<p_2<\cdots <p_k$. The Gruenberg-Kegel graph of $G$, denoted $GK\left(G\right)$, is defined as follows: its vertex set is $\pi \left(G\right)$ and two different vertices $p_i$ and $p_j$ are adjacent by an edge if and only if $G$ contains an element of order $p_i{p}_j$. The degree of a vertex $p_i$ in $\mathrm{GK}\left(G\right)$ is denoted by $d_G\left(p_i\right)$ and the $k$-tuple $D\left(G\right)=(d_G\left(p_1\right),d_G\left(p_2\right),...,d_G\left(p_k\right))$ is said to be the degree pattern of $G$. Moreover, if $\omega \subseteq \pi \left(G\right)$ is the vertex set of a connected component of $GK\left(G\right)$, then the largest $\omega$-number which divides $\left|G\right|$, is...

Si costruiscono curve di genere $g=4n\mathrm{—}3$, $n\ge 3$ che hanno $2^{n-3}(2^{n-2}-1)$ fasci semicanonici $L$ tali che $h^0(L)=4$. Per $n+3$ si dimostra che gli $L$ sono molto ampi.

Let d be a positive integer and α a real algebraic number of degree d + 1. Set $\alpha ̲:=(\alpha ,\alpha ²,...,{\alpha }^d)$. It is well-known that $c\left(\alpha ̲\right):=limin{f}_{q\to \infty }{q}^{1/d}·\left|\right|q\alpha ̲\left|\right|>0$, where ||·|| denotes the distance to the nearest integer. Furthermore, $c\left(\alpha ̲\right)n^{-1/d}\le c\left(n\alpha ̲\right)\le nc\left(\alpha ̲\right)$ for any integer n ≥ 1. Our main result asserts that there exists a real number C, depending only on α, such that $c\left(n\alpha ̲\right)\le C{n}^{-1/d}$ for any integer n ≥ 1.