相关论文: The displacement and split decompositions for a $Q…

Let $\Gamma$ be a simple finite graph with vertex set $V(\Gamma)$ and edge set $E(\Gamma)$. Let $\mathcal{R}$ be an equivalence relation on $V(\Gamma)$. The $\mathcal{R}$-super $\Gamma$ graph $\Gamma^{\mathcal{R}}$ is a simple graph with…

We generalise the fold map for the wedge sum and use this to give a loop space decomposition of topological spaces with a high degree of symmetry. This is applied to polyhedral products to give a loop space decomposition of polyhedral…

Motivated by longstanding conjectures regarding decompositions of graphs into paths and cycles, we prove the following optimal decomposition results for random graphs. Let $0<p<1$ be constant and let $G\sim G_{n,p}$. Let $odd(G)$ be the…

A graph G is said to be M-integral (resp. A-integral, D-integral, DL-integral or DQ-integral) if all eigenvalues of its matrix M (resp. adjacency matrix A(G), distance matrix D(G), distance Laplacian matrix DL(G) or distance signless…

We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition. The length of a path-decomposition of a graph is the…

We study the relationship between two key concepts in the theory of (di)graphs: the quotient digraph, and the lift $\Gamma^{\alpha}$ of a base (voltage) digraph. These techniques contract or expand a given digraph in order to study its…

In this note we consider the question how the set of inversions of a permutation $\pi \in S_n$ can be partitioned into two subset, such that those are itself inversion sets of permutations. This is archived by exploiting a connection to a…

In this this paper we introduce entanglement among the points in a non-commutative scheme, in addition to the tangent directions. A diagram of $A$-modules is a pair $\uc=(|\uc|,\Gamma)$ where $|\uc|={V_1,...,V_r}$ is a set of $A$-modules,…

Let $V$ be a two-dimensional vector space over a field $\mathbb F$ of characteristic not $2$ or $3$. We show there is a canonical surjection $\nu$ from the set of suitably generic commutative algebra structures on $V$ modulo the action of…

We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of…

For any positive definite rational quadratic form $q$ of $n$ variables let $G(\mathbb{Q}^n, q)$ denote the graph with vertices $\mathbb{Q}^n$ and $x, y \in \mathbb{Q}^n$ connected iff $q(x - y) = 1$. This notion generalises standard…

In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…

Cospectral graphs are a fascinating concept in graph theory, where two non-isomorphic graphs possess identical sets of eigenvalues. In this paper, we compute the $A_\alpha$-characteristic polynomial of neighbour and non-neighbour splitting…

We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…

We prove that if $G$ is a graph and $r_1, ..., r_k \in \mathbb{Z}_{\geq 0}$ such that $\sum_{i=1}^k r_i \geq \Delta(G) + 2 - k$ then $V(G)$ can be partitioned into sets $V_1, ..., V_k$ such that $\Delta(G[V_i]) \leq r_i$ and $G[V_i]$…

We discuss the Grassmann graph $J_q(N,D)$ with $N \geq 2D$, having as vertices the $D$-dimensional subspaces of an $N$-dimensional vector space over the finite field $\mathbb{F}_q$. This graph is distance-regular with diameter $D$; to avoid…

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…

New methods for $D$-decomposition analysis are presented. They are based on topology of real algebraic varieties and computational real algebraic geometry. The estimate of number of root invariant regions for polynomial parametric families…

We consider the problem of decomposing the edges of a digraph into as few paths as possible. A natural lower bound for the number of paths in any path decomposition of a digraph $D$ is $\frac{1}{2}\sum_{v\in V(D)}|d^+(v)-d^-(v)|$; any…

Using the new extension of the zero-divisor graph $\widetilde{\Gamma}(R)$ introduced in \cite{Groupe}, we give an approach of the diameter of $\Gamma(R)$ and $\Gamma(R[X])$ other than given in \cite{Lucas} thus we give a complete…