Related papers: An exact formula for the contraction factor of a s…
We consider the topologically constrained random walk model for topological polymers. In this model, the polymer forms an arbitrary graph whose edges are selected from an appropriate multivariate Gaussian which takes into account the…
Suppose we have an embedding of a graph $\mathbf{G}$ created by subdividing the edges of a simpler graph $\mathbf{G'}$. The edges of $\mathbf{G}$ can be divided into subsets which join pairs of ``junction'' vertices in $\mathbf{G'}$. The…
The present research is dedicated to provide deeper understanding of the impact of complex architecture of branched polymers on their behaviour in solvents. The folding dynamics of macromolecules and hydrodynamics of polymer fluids are…
We establish several contraction formulas for Kirchhoff index. We relate Kirchhoff index with some other metrized graph invariants. By applying our contraction formulas successively when the graph is a tree, we derive new formulas for…
The mathematical derivation of the mean square radius of gyration, <s2x>, of branched polymers is reinvestigated from a kinetic-equation-point of view. In particular we derive the corresponding quantity of the A-R-Bf-1 model; the result…
Let $R(G)$ be the graph obtained from $G$ by adding a new vertex corresponding to each edge of $G$ and by joining each new vertex to the end vertices of the corresponding edge. Let $RT(G)$ be the graph obtained from $R(G)$ by adding a new…
An integral convex polytope ${\mathcal P}$ is said to be Gorenstein if its toric ring $K[{\mathcal P}]$ is normal and Gorenstein. In this paper, Gorenstein cut polytopes of graphs are characterized explicitly. First, we prove that…
We consider polymers attached to the tip of a cone, and the resulting force due to entropy loss on approaching a plate (or another cone). At separations shorter than the polymer radius of gyration R_g, the only relevant length scale is the…
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…
The segment distribution around the center of gravity is derived for unperturbed ring polymers. We show that, although a small difference is observed, the exact distribution can be well approximated by the Gaussian probability distribution…
In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of graphs with generalized pockets in terms of the resistance distance and Kirchhoff index of the factor graph.
Let $G_n$ be a graph obtained by the strong product of $P_2$ and $C_n$, where $n\geqslant3$. In this paper, explicit expressions for the Kirchhoff index, multiplicative degree-Kirchhoff index and number of spanning trees of $G_n$ are…
The subdivision graph $S(G)$ of a graph $G$ is the graph obtained by inserting a new vertex into every edge of $G$. In $\cite{PL}$, two classes of new corona graphs, the corona-vertex of the subdivision graph $G_{1}\diamondsuit G_{2}$ and…
We compute, in the large $N$ limit, the topologically twisted index of the 3d $T[SU(N)]$ theory, namely the partition function on $\Sigma_{\mathfrak{g}} \times S^1$, with a topological twist on the Riemann surface $\Sigma_{\mathfrak{g}}$.…
For a graph G, the graph R(G) of a graph G is the graph obtained by adding a new vertex for each edge of G and joining each new vertex to both end vertices of the correspond- ing edge. Let I(G) be the set of newly added vertices. In this…
Let R be a Henselian discrete valuation ring with field of fractions K. If X is a smooth variety over K and G a torus over K, then we consider X-torsors under G. If XX/R is a model of X then, using a result of Brahm, we show that X-torsors…
A ring polymer is a random walk whose steps obey a single linear condition; their sum vanishes. Factoring the graph Laplacian into the product of the incidence matrix and its transpose allows us to show that for a more complicated network,…
A (3,4)-biregular bigraph G is a bipartite graph where all vertices in one part have degree 3 and all vertices in the other part have degree 4. A path factor of G is a spanning subgraph whose components are nontrivial paths. We prove that a…
The present paper considers multipartite graphs from the perspective of design theory and coding theory. A one-factor $F$ of the complete multipartite graph $K_{n\times g}$ (with $n$ parts of size $g$) gives rise to a $(g+1)$-ary code…
For various polymers with different topological structures we numerically evaluate the mean-square radius of gyration and the hydrodynamic radius systematically through simulation. We call polymers with nontrivial topology topological…