相关论文: Mobius energy of graphs

Modern energy systems in vehicles and built infrastructure are governed by high-dimensional dynamics spanning multiple physical domains (e.g., electrical, thermal, mechanical) and timescales. This tutorial paper presents a graph-based…

We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…

An intrinsic metric tensor, a flat connexion and the corresponding distance-like function are constructed in the configuration space formed by velocity field {\bf and} the thermodynamic variables of an inviscid fluid. The kinetic-energy…

Answering some questions of Gutman, we show that, except for four specific trees, every connected graph G of order n, with no cycle of order 4 and with maximum degree at most 3, has energy greater that its order. Here, the energy of a graph…

In a previous publication [1], local gauge invariant geometric variables were introduced to describe the physical Hilbert space of Yang-Mills theory. In these variables, the electric energy involves the inverse of an operator which can…

Graph embedding has become an increasingly important technique for analyzing graph-structured data. By representing nodes in a graph as vectors in a low-dimensional space, graph embedding enables efficient graph processing and analysis…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

We investigate linear parabolic maps on the torus. In a generic case these maps are non-invertible and discontinuous. Although the metric entropy of these systems is equal to zero, their dynamics is non-trivial due to folding of the image…

We study embeddings of a graph $G$ in a surface $S$ by considering representatives of different classes of $H_1(S)$ and their intersections. We construct a matrix invariant that can be used to detect homological invariance of elements of…

Let $G$ be a graph with the vertex set $ \lbrace v_1,\ldots,v_n \rbrace$. The Seidel matrix of $G$ is an $n\times n$ matrix whose diagonal entries are zero, $ij$-th entry is $-1$ if $ v_{i} $ and $ v_{j} $ are adjacent and otherwise is $ 1…

The energy of a graph $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of $G$. Let $n$ be an even number and $\mathbb{U}_{n}$ be the set of all conjugated unicyclic graphs of order $n$ with maximum…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

Consider a simple graph $G$ with vertex set $V = \{v_1, v_2, \ldots, v_n\}$ and edge set $E$. The diminished Sombor matrix $M_{DS}(G)$ is constructed such that its $(i, j)$ entry is $\frac{\sqrt{d_i^2+d_j^2}}{d_i+d_j}$ if vertices $v_iv_j…

We provide a data structure for maintaining an embedding of a graph on a surface (represented combinatorially by a permutation of edges around each vertex) and computing generators of the fundamental group of the surface, in amortized time…

This paper offers an informal instructive introduction to some of the main notions of geometric continuum mechanics for the case of smooth fields. We use a metric invariant stress theory of continuum mechanics to formulate a simple…

The eccentricity (anti-adjacency) matrix $\varepsilon(G)$ of a graph $G$ is obtained from the distance matrix by retaining the eccentricities in each row and each column. The $\varepsilon$-eigenvalues of a graph $G$ are those of its…

We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…

In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…

Following some recent work by Gross, we consider the partition function for QCD on a two dimensional torus and study its stringiness. We present strong evidence that the free energy corresponds to a sum over branched surfaces with small…

The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…