Related papers: The critical exponent: a novel graph invariant

The study of entrywise powers of matrices was originated by Loewner in the pursuit of the Bieberbach conjecture. Since the work of FitzGerald and Horn (1977), it is known that $A^{\circ \alpha} := (a_{ij}^\alpha)$ is positive semidefinite…

In this paper we study acyclic colouring in the random subgraph $\mathit{G}$ of the complete graph $\mathit{K}_n$ on $\mathit{n}$ vertices where each edge is present with probability $\mathit{p}$; independent of the other edges. We show…

Let $\mathbb{P}_G([0,\infty))$ and $\mathbb{P}_G^{'}([0,\infty))$ be the sets of positive semidefinite and positive definite matrices of order $n$, respectively, with nonnegative entries, where some positions of zero entries are restricted…

Let $X$ be a proper geodesic Gromov hyperbolic metric space and let $G$ be a cocompact group of isometries of $X$ admitting a uniform lattice. Let $d$ be the Hausdorff dimension of the Gromov boundary $\partial X$. We define the critical…

Assuming a unitarily invariant norm $|||\cdot|||$ is given on a two-sided ideal of bounded linear operators acting on a separable Hilbert space, it induces some unitarily invariant norms $|||\cdot|||$ on matrix algebras $\mathcal{M}_n$ for…

In the last years the attention towards topological dynamical properties of highly discontinuous maps has increased significantly. In [D.Corona, A. Della Corte. The critical exponent functions. Comptes Rendus Math\'ematique, 360(G4),…

We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…

A spanning subgraph of a graph G is called a [0,2]-factor of G, if for . is a union of some disjoint cycles, paths and isolate vertices, that span the graph G. It is easy to get a [0,2]-factor of G and there would be many of [0,2]-factors…

A real seminormed involutive algebra is a real associative algebra ${\mathcal A}$ endowed with an involutive antiautomorphism $*$ and a submultiplicative seminorm $p$ with $p(a^*) =p(a)$ for $a\in {\mathcal A}$. Then ${\mathop{\tt…

It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…

This paper considers an invariant of modules over a finite-dimensional Hopf algebra, called the critical group. This generalizes the critical groups of complex finite group representations studied by Benkart, Klivans, Reiner and Gaetz. A…

Let $G$ be a graph on $n$ vertices, its adjacency matrix and degree diagonal matrix are denoted by $A(G)$ and $D(G)$, respectively. In 2017, Nikiforov \cite{0007} introduced the matrix $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$ for…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

Suppose $G$ is a controllable graph of order $n$ with adjacency matrix $A$. Let $W=[e,Ae,\ldots,A^{n-1}e]$ ($e$ is the all-one vector) and $\Delta=\prod_{i>j}(\alpha_i-\alpha_j)^2$ ($\alpha_i$'s are eigenvalues of $A$) be the walk matrix…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right] $, write $A_{\alpha}\left( G\right) $ for the matrix \[ A_{\alpha}\left( G\right)…

Finding a new mathematical representations for graph, which allows direct comparison between different graph structures, is an open-ended research direction. Having such a representation is the first prerequisite for a variety of machine…

For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…

Let $G$ be a connected simple graph of order $n$ and let $\Delta(G)$ and $\chi'(G)$ denote the maximum degree and chromatic index of $G$, respectively. Vizing proved that $\chi'(G)=\Delta(G)$ or $\Delta(G)+1$. Following this result, $G$ is…

A new method of analysing positive bistochastic maps on the algebra of complex matrices $M_{3}$ has been proposed. By identifying the set of such maps with a convex set of linear operators on $\mathbb{R}^{8}$, one can employ techniques from…

Let $\gamma(G)$ be the domination number of a graph $G$. A graph $G$ is \emph{domination-vertex-critical}, or \emph{$\gamma$-vertex-critical}, if $\gamma(G-v)< \gamma(G)$ for every vertex $v \in V(G)$. In this paper, we show that: Let $G$…