Related papers: Substructure Analysis and Cycle Enumeration Method…

For a symmetric 2t-cycle in the tope graph of a simple oriented matroid M on the ground set {1,...,t}, where t is even, we describe decompositions of topes and subtopes of M with respect to the subtopes corresponding to the edges of the…

For a plane curve, a point in the projective plane is said to be Galois when the point projection induces a Galois extension of function fields. We give a new characterization of a Fermat curve whose degree minus one is a power of $p$ in…

We compute the elementary divisors of the adjacency and Laplacian matrices of families of polar graphs. These graphs have as vertices the isotropic one-dimensional subspaces of finite vector spaces with respect to non-degenerate forms, with…

In this paper, we explore the discriminative power of Grassmannian persistence diagrams of 1-parameter filtrations, examine their relationships with other related constructions, and study their computational aspects. Grassmannian…

This work introduces a novel algorithm for finding the connected components of a graph where the vertices and edges are grouped into sets defining a Set--Based Graph. The algorithm, under certain restrictions on those sets, has the…

Although the Laplace approximation offers a simple route to uncertainty quantification in deep neural networks, its reliance on inverting large Hessian matrices has motivated a range of computationally feasible low-dimensional or sparse…

Due to the limited resources and the scale of the graphs in modern datasets, we often get to observe a sampled subgraph of a larger original graph of interest, whether it is the worldwide web that has been crawled or social connections that…

Let p be an odd prime. The lattice of all normal subgroups and the terms of the lower and upper central series are determined for all metabelian p-groups with generator rank d=2 having abelianization of type (p,p) and minimal defect of…

These notes develop aspects of perturbation theory of matrices related to so-called diagonalisation schemes. Primary focus is on constructive tools to derive asymptotic expansions for small/large parameters of eigenvalues and…

Random Hermitian matrices with a source term arise, for instance, in the study of non-intersecting Brownian walkers \cite{Adler:2009a, Daems:2007} and sample covariance matrices \cite{Baik:2005}. We consider the case when the $n\times n$…

If $G$ is a graph, its Laplacian is the difference between diagonal matrix of its vertex degrees and its adjacency matrix. A one-edge connection of two graphs $G_{1}$ and $G_{2}$ is a graph $G=G_{1}\odot G_{2}$ with $V(G)=V(G_{1})\cup…

We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…

We consider the following generalization of dominating sets: Let $G$ be a host graph and $P$ be a pattern graph $P$. A dominating $P$-pattern in $G$ is a subset $S$ of vertices in $G$ that (1) forms a dominating set in $G$ \emph{and} (2)…

In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromatic number of some Cartesian products. One of our main…

We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…

The $r$-th iterated line graph $L^{r}(G)$ of a graph $G$ is defined by: (i) $L^{0}(G) = G$ and (ii) $L^{r}(G) = L(L^{(r- 1)}(G))$ for $r > 0$, where $L(G)$ denotes the line graph of $G$. The Hamiltonian Index $h(G)$ of $G$ is the smallest…

Let the sign components of the maximal covectors of a simple oriented matroid M be represented by the real numbers -1 and 1. Consider the vertex set V(R) of a symmetric cycle R of adjacent topes in the tope graph of M as a subposet of the…

Given a diagonalizable $N\times N$ matrix $H$, whose non-degenerate spectrum consists of $p$ pairs of complex conjugate eigenvalues and additional $N-2p$ real eigenvalues, we determine all metrics $M$, of all possible signatures, with…

In this article, various aspects of Laplacian spectra of power graphs of finite cyclic, dicyclic and finite $p$-groups are studied. Algebraic connectivity of power graphs of the above groups are considered and determined completely for that…

We present statistics on the decompositions (with respect to a distinguished symmetric 2t-cycle) of vertices of the hypercube graph, whose negative parts are covered by two subsets of the ground set {1,...,t} of the corresponding oriented…