Related papers: Weakly distance-regular digraphs of valency three,…
The aim of this paper is to address an open problem given in [Kirk, W. A., Shahzad, Naseer, Normal structure and orbital fixed point conditions, J. Math. Anal. Appl. {\bf{vol 463(2)}}, (2018) 461--476]. We give a characterization of weak…
We consider a class of generalized nonexpansive mappings introduced by Karapinar [5] and seen as a generalization of Suzuki (C)-condition. We prove some weak and strong convergence theorems for approximating fixed points of such mappings…
We show that the size of a 4-critical graph of girth at least five is bounded by a linear function of its genus. This strengthens the previous bound on the size of such graphs given by Thomassen. It also serves as the basic case for the…
In this paper, we point out that the definition of weak tracial approximation can be improved and strengthened. An example of weak tracial approximation is also provided.
This erratum will correct the classification of Theorem 1 in Lin-Lu-Yau, Comm. Anal. Geom., 2014, that misses the Triplex graph.
We study a new type of higher categorical structure, called weakly globular n-fold category, previously introduced by the author. We show that this structure is a model of weak n-categories by proving that it is suitably equivalent to the…
In 2017, Giudici, Li and the third author constructed the first known family of vertex-primitive $2$-arc-transitive digraphs of valency at least $2$. The smallest digraph in this family admits $\mathrm{PSL}_3(49)$ acting…
We derive the weak value deflection given in a paper by Dixon et al. (Phys. Rev. Lett. 102, 173601 (2009)) both quantum mechanically and classically. This paper is meant to cover some of the mathematical details omitted in that paper owing…
In this short note it is shown that every graph of diameter 2 and minimum degree at least 3 contains a cycle of length 4 or 8. This result contributes to the study of the Erd\H{o}s-Gy\'arf\'as Conjecture by confirming it for the class of…
We discuss weak lensing characteristics in the gravitational field of a compact object in the low-energy approximation of fourth order f(R) gravity theory. The particular solution is characterized by a gravitational strength parameter…
A non-complete graph $\Gamma$ is said to be $(G,2)$-distance transitive if $G$ is a subgroup of the automorphism group of $\Gamma$ that is transitive on the vertex set of $\Gamma$, and for any vertex $u$ of $\Gamma$, the stabilizer $G_u$ is…
In this survey we overview known results on the strong subgraph $k$-connectivity and strong subgraph $k$-arc-connectivity of digraphs. After an introductory section, the paper is divided into four sections: basic results, algorithms and…
We prove that a graph on up to 9 vertices is a unit-distance graph if and only if it does not contain one of 74 so-called minimal forbidden graphs. This extends the work of Chilakamarri and Mahoney (1995), who provide a similar…
In 2013, Chan classified all metric hyperelliptic graphs, proving that divisorial gonality and geometric gonality are equivalent in the hyperelliptic case. We show that such a classification extends to combinatorial graphs of divisorial…
In this paper, we classify distance regular graphs such that all of its second largest local eigenvalues are at most one. Also we discuss the consequences for the smallest eigenvalue of a distance-regular graph. These extend a result by the…
In an early paper, He and Tang [Biometrika 100 (2013) 254-260] introduced and studied a new class of designs, strong orthogonal arrays, for computer experiments, and characterized such arrays through generalized orthogonal arrays. The…
We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…
A 2-component oriented link in $S^3$ is called weakly doubly slice if it is a cross-section of an unknotted sphere in $S^4$, and strongly doubly slice if it is a cross-section of a 2-component trivial spherical link in $S^4$. We give the…
Let (X,dX) and (Y,dY) be semimetric spaces with distance sets D(X) and, respectively, D(Y). A mapping F : X \to Y is a weak similarity if it is surjective and there exists a strictly increasing f : D(Y) \to D(X) such that dX = f \circ dY…
We determine the distance-regular graphs with diameter at least $3$ and $c_2\geq 2$ but without induced $K_{1,4}$-subgraphs.