Related papers: Micronuclear Sequences Associated with Assembly Gr…
In this paper, we study long paths and Hamiltonian paths in inhomogenous random graphs. In the first part of the paper, we consider an inhomogenous Erd\H{o}s-R\'enyi random graph $G_E$ with average edge density $p_n.$ We prove that if…
We describe a new generation of algorithms capable of mapping the structure and conformations of macromolecules and their complexes from large ensembles of heterogeneous snapshots, and demonstrate the feasibility of determining both…
Next-generation electronics calls for new materials beyond silicon for increased functionality, performance, and scaling in integrated circuits. Carbon nanotubes and semiconductor nanowires are at the forefront of these materials, but have…
We consider feature representation learning problem of molecular graphs. Graph Neural Networks have been widely used in feature representation learning of molecular graphs. However, most existing methods deal with molecular graphs…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic. In this work we present…
We consider finite graphs whose vertexes are supersingular elliptic curves, possibly with level structure, and edges are isogenies. They can be applied to the study of modular forms and to isogeny based cryptography. The main result of this…
Uniform sampling of simple graphs having a given degree sequence is a known problem with exponential complexity in the square of the mean degree. For undirected graphs, randomised approximation algorithms have nonetheless been shown to…
We consider the derangement graph in which the vertices are permutations of $\{ 1,\ldots, n\}$. Two vertices are joined by an edge if the corresponding permutations differ in every position. The derangement graph is known to be Hamiltonian…
We give a characterization of the effect of sequences of pivot operations on a graph by relating it to determinants of adjacency matrices. This allows us to deduce that two sequences of pivot operations are equivalent iff they contain the…
Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an…
We present a new method for obtaining matched solutions of the rms envelope equations. In this approach, the envelope equations are first expressed in Hamiltonian form. The Hamiltonian defines a nonlinear mapping, $\cal M$, and for periodic…
We uncover the very rich graph topology of generic bounded non-Hermitian spectra, distinct from the topology of conventional band invariants and complex spectral winding. The graph configuration of complex spectra are characterized by the…
Recent experiments on hydrogenated amorphous silicon using infrared absorption spectroscopy have indicated the presence of mono- and divacancy in samples for concentration of up to 14\% hydrogen. Motivated by this observation, we study the…
We investigate the Minimum Eccentricity Shortest Path problem in some structured graph classes. It asks for a given graph to find a shortest path with minimum eccentricity. Although it is NP-hard in general graphs, we demonstrate that a…
Molecule generation is central to a variety of applications. Current attention has been paid to approaching the generation task as subgraph prediction and assembling. Nevertheless, these methods usually rely on hand-crafted or external…
In this paper, we first study what we call Superset-Subset-Disjoint (SSD) set system. Based on properties of SSD set system, we derive the following (I) to (IV): (I) For a nonnegative integer $k$ and a graph $G=(V,E)$ with $|V|\ge2$, let…
We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…
We undertake a quantitative comparison of multi-fragmentation reactions, as modeled by two different approaches: the Antisymmetrized Molecular Dynamics (AMD) and the momentum-dependent stochastic mean-field (SMF) model. Fragment observables…
We enumerate chord diagrams without loops and without both loops and parallel chords. We show that the former ones describe Hamiltonian paths in $n$-dimensional octahedrons. The latter ones are also known as shapes. For labelled diagrams we…