Related papers: Elastic Graphs
Based on first-principles calculations, we resent a method to reveal the elastic properties of recently synthesized monolayer hydrocarbon, graphane. The in-plane stiffness and Poisson's ratio values are found to be smaller than those of…
The enhanced power graph of a group $G$ is a graph with vertex set $G,$ where two distinct vertices $x$ and $y$ are adjacent if and only if there exists an element $w$ in $G$ such that both $x$ and $y$ are powers of $w.$ In this paper, we…
A complex unit gain graph ($ \mathbb{T} $-gain graph), $ \Phi=(G, \varphi) $ is a graph where the gain function $ \varphi $ assigns a unit complex number to each orientation of an edge of $ G $ and its inverse is assigned to the opposite…
We introduce and study a class of exchangeable random graph ensembles. They can be used as statistical null models for empirical networks, and as a tool for theoretical investigations. We provide general theorems that carachterize the…
Modern social networks frequently encompass multiple distinct types of connectivity information; for instance, explicitly acknowledged friend relationships might complement behavioral measures that link users according to their actions or…
Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
We collect and present in a unified way several results in recent years about the elastic flow of curves and networks, trying to draw the state of the art of the subject. In particular, we give a complete proof of global existence and…
Dense rubbery networks are highly entangled polymer systems, with significant topological restrictions for the mobility of neighbouring chains and crosslinks preventing the reptation constraint release. In a mean field approach,…
We investigate a special case of hereditary property in graphs, referred to as {\em robustness}. A property (or structure) is called robust in a graph $G$ if it is inherited by all the connected spanning subgraphs of $G$. We motivate this…
By combining continuum elasticity theory and tight-binding atomistic simulations, we work out the constitutive nonlinear stress-strain relation for graphene stretching elasticity and we calculate all the corresponding nonlinear elastic…
For a connected graph $G$, its resistance distance matrix is denoted by $R(G)$. A graph is called resistance regular if all the row (or column) sums of $R(G)$ are equal. We provide a necessary and sufficient condition for a simple connected…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only…
Dynamic graph learning has gained significant attention as it offers a powerful means to model intricate interactions among entities across various real-world and scientific domains. Notably, graphs serve as effective representations for…
A great variety of systems in nature, society and technology -- from the web of sexual contacts to the Internet, from the nervous system to power grids -- can be modeled as graphs of vertices coupled by edges. The network structure,…
A graph $G$ is \emph{nonsingular (singular)} if its adjacency matrix $A(G)$ is nonsingular (singular). In this article, we consider the nonsingularity of block graphs, i.e., graphs in which every block is a clique. Extending the problem, we…
To any inhibition-dominated threshold-linear network (TLN) we can associate a directed graph that captures the pattern of strong and weak inhibition between neurons. Robust motifs are graphs for which the structure of fixed points in the…
In this article, we unravel an intimate relationship between two seemingly unrelated concepts: elasticity, that defines the local relations between stress and strain of deformable bodies, and topology that classifies their global shape.…
We consider a dynamical system consisting of subsystems indexed by a lattice. Each subsystem has one conserved degree of freedom ("energy") the rest being uniformly hyperbolic. The subsystems are weakly coupled together so that the sum of…