相关论文: Two particles on a star graph I

We consider a system of charged particles moving on the real line driven by electrostatic interactions. Since we consider charges of both signs, collisions might occur in finite time. Upon collision, some of the colliding particles are…

A biclique of a graph $G$ is an induced complete bipartite subgraph of $G$ such that neither part is empty. A star is a biclique of $G$ such that one part has exactly one vertex. The star graph of $G$ is the intersection graph of the…

Motivated by applications in data science, we study partial differential equations on graphs. By a classical fixed-point argument, we show existence and uniqueness of solutions to a class of nonlocal continuity equations on graphs. We…

We consider the two-star model, a family of exponential random graphs indexed by two real parameters, $h$ and $\alpha$, that rule respectively the total number of edges and the mutual dependence between them. Borrowing tools from…

A vertex $v \in V(G)$ is called $\lambda$-main if it belongs to a star set $X \subset V(G)$ of the eigenvalue $\lambda$ of a graph $G$ and this eigenvalue is main for the graph obtained from $G$ by deleting all the vertices in $X \setminus…

A growing number of dynamical situations involve the coupling of particles or singularities with physical waves. In principle these situations are very far from the wave-particle duality at quantum scale where the wave is probabilistic by…

We investigate the nonlinear Schr\"odinger equation on a three-edge star graph, where each edge contains a linear localized inhomogeneity in the form of a Dirac delta linear potential. Such systems are of significant interest in studying…

We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…

We construct models of exactly solvable two-particle quantum graphs with certain non-local two-particle interactions, establishing appropriate boundary conditions via suitable self-adjoint realisations of the two-particle Laplacian. Showing…

We consider the equilibria of point particles under the action of two body central forces in which there are both repulsive and attractive interactions, often known as central configurations, with diverse applications in physics, in…

Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…

A star of length $ \ell $ is defined as the complete bipartite graph $ K_{1,\ell } $. In this paper we deal with the problem of edge decomposition of graphs into stars of varying lengths. Given a graph $ G $ and a list of integers…

This chapter is devoted to the analysis of jamming and percolation behavior of two-dimensional systems of elongated particles. We consider both continuous and discrete spaces (with the special attention to the square lattice), as well the…

Extending the well-known star-comb lemma for infinite graphs, we characterise the graphs that do not contain an infinite comb or an infinite star, respectively, attached to a given set of vertices. We offer several characterisations: in…

In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…

We consider the problem of finding a subgraph of a given graph minimizing the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already for bipartite graphs when the functions are convex on…

This paper studies a system of $n \in \mathbb{N}: \, n \geq 2$ non-relativistic, spinless quantum particles moving on the real line and interacting via a two-body delta potential. The Hamiltonian of such a system is proved to be affiliated…

We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenvalue at most 1.

In this work we focus on the dynamics of macromolecular networks formed by end-linking identical polymer stars. The resulting macromolecular network can then be viewed as consisting of spacers which connect branching points (the cores of…

Differential equations on metric graphs can describe many phenomena in the physical world but also the spread of information on social media. To efficiently compute the solution is a hard task in numerical analysis. Solving a design…