Related papers: Elastic Graphs
Statistical graph models aim at modeling graphs as random realization among a set of possible graphs. One issue is to evaluate whether or not a graph is likely to have been generated by one particular model. In this paper we introduce the…
Let $G$ be a graph with $n$ vertices and $m$ edges. The energy $E$ of the graph $G$ is defined as the sum of the moduli of the adjacency eigenvalues $\lambda_{1} \geq \lambda_{2} \geq \ldots \geq \lambda_{n}$ of $G$: $$…
Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…
The rigidity of a network of elastic beams crucially depends on the specific details of its structure. We show both numerically and theoretically that there is a class of isotropic networks which are stiffer than any other isotropic network…
Inspired by theories such as Loop Quantum Gravity, a class of stochastic graph dynamics was studied in an attempt to gain a better understanding of discrete relational systems under the influence of local dynamics. Unlabeled graphs in a…
We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.
A string graph is the intersection graph of curves in the plane. We prove that there exists an absolute constant $c>0$ such that if $G$ is a string graph on $n$ vertices, then $G$ contains either a clique or an independent set of size at…
The central nervous system is composed of many individual units -- from cells to areas -- that are connected with one another in a complex pattern of functional interactions that supports perception, action, and cognition. One natural and…
This work is motivated by discrete-to-continuum modeling of the mechanics of a graphene sheet, which is a single-atom thick macromolecule of carbon atoms covalently bonded to form a hexagonal lattice. The strong covalent bonding makes the…
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…
A new formalism is used for a Monte Carlo determination of the elastic constants of a two-dimensional net of fixed connectivity. The net is composed of point-like atoms each of which is tethered to six neighbors by a bond limiting the…
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…
A graph is beyond-planar if it can be drawn in the plane with a specific restriction on crossings. Several types of beyond-planar graphs have been investigated, such as k-planar if every edge is crossed at most k times and RAC if edges can…
Snapping mechanisms are investigated for an elastic strip with ends imposed to move and rotate in time. Attacking the problem analytically via Euler's elastica and the second variation of the total potential energy, the number of stable…
Effective resistance (ER) is an attractive way to interrogate the structure of graphs. It is an alternative to computing the eigen-vectors of the graph Laplacian. Graph laplacians are used to find low dimensional structures in high…
Entangled networks are ubiquitous in tissues, polymers, and fabrics. However, their mechanics remain insufficiently understood due to the complexity of the topological constraints at the network level. Here, we develop a mathematical…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…
In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…
The power graph of a group is the simple graph whose vertices are the group elements and two vertices are adjacent whenever one of them is a positive power of the other. We characterize the finite nilpotent groups whose power graphs have…