Related papers: The displacement and split decompositions for a $Q…

In this note we obtain an explicit formula for the Hosoya polynomial of any distance-regular graph in terms of its intersection array. As a consequence, we obtain a very simple formula for the Hosoya polynomial of any strongly regular…

AGT relations imply that the four-point conformal block admits a decomposition into a sum over pairs of Young diagrams of essentially rational Nekrasov functions - this is immediately seen when conformal block is represented in the form of…

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

Let $\Gamma$ denote a bipartite graph with vertex set $X$, color partitions $Y$, $Y'$, and assume that every vertex in $Y$ has eccentricity $D\ge 3$. For $z\in X$ and a non-negative integer $i$, let $\Gamma_{i}(z)$ denote the set of…

In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…

We consider Gallai's graph Modular Decomposition theory for network analytics. On the one hand, by arguing that this is a choice tool for understanding structural and functional similarities among nodes in a network. On the other, by…

Let R be a commutative ring and M be an R-module. We define the large sum graph, denoted by \acute{G}(M), as a graph with the vertex set of non-large submodules of M and two distinct vertices are adjacent if and only if N + K is a non-large…

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph, with vertex set $X$ and diameter $D\geq 3$. The standard module $V$ has a basis $\lbrace {\hat x} \vert x \in X\rbrace$, where ${\hat x}$ denotes column $x$ of the identity matrix…

For a group $G,$ the generating graph of $G,$ denoted by $\Gamma(G).$ We define $Q_n=\langle x,y: x^{2n}=y^4=1, x^n=y^2,y^{-1}xy=x^{-1}\rangle,$ the dicyclic group of order $4n.$ This paper primarily delves into exploring the graph…

We give a new determinant expression for the characteristic polynomial of the bond scattering matrix of a quantum graph G. Also, we give a decomposition formula for the characteristic polynomial of the bond scattering matrix of a regular…

In this paper, we consider the distance spectra of the derangement graphs. First we give a constructive proof that the connected derangement graphs are of diameter 2. Then we obtain their distance spectra. In particular, we determine all…

We study P-groupoids that arise from certain decompositions of complete graphs. We show that left distributive P-groupoids are distributive, quasigroups. We characterize P-groupoids when the corresponding decomposition is a Hamiltonian…

This paper provides two characterizations of regularity for near-vector spaces: first, by expressing them as a direct sum of vector spaces over division rings formed by distributive elements; second, by expressing their dimension in term of…

To every finite metric space $X$, including all connected unweighted graphs with the minimum edge-distance metric, we attach an invariant that we call its blowup-polynomial $p_X(\{ n_x : x \in X \})$. This is obtained from the blowup…

Let the Kneser graph $K$ of a distance-regular graph $\Gamma$ be the graph on the same vertex set as $\Gamma$, where two vertices are adjacent when they have maximal distance in $\Gamma$. We study the situation where the Bose-Mesner algebra…

In this paper we prove that any distance-balanced graph $G$ with $\Delta(G)\geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $\Delta(T)\geq…

A weakly distance-regular digraph is $P$-polynomial if its attached scheme is $P$-polynomial. In this paper, we characterize all $P$-polynomial weakly distance-regular digraphs.

A connected graph $\G$ is called {\em nicely distance--balanced}, whenever there exists a positive integer $\gamma=\gamma(\G)$, such that for any two adjacent vertices $u,v$ of $\G$ there are exactly $\gamma$ vertices of $\G$ which are…

A tuple of commuting operators $(S_1,\dots,S_{n-1},P)$ for which the closed symmetrized polydisc $\Gamma_n$ is a spectral set is called a $\Gamma_n$-contraction. We show that every $\Gamma_n$-contraction admits a decomposition into a…

A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…