相关论文: Energy of signed digraphs

Let $D$ be a weighted oriented graph and $I(D)$ be its edge ideal. If $D$ contains an induced odd cycle of length $2n+1$, under certain condition we show that $ {I(D)}^{(n+1)} \neq {I(D)}^{n+1}$. We give necessary and sufficient condition…

A signed graph has edge weights drawn from the set $\{+1,-1\}$, and is termed sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is called sign-unbalanced. A nut graph has a one…

We study the appearance of directed energy current in homogeneous spatially extended systems coupled to a heat bath in the presence of an external ac field E(t). The systems are described by nonlinear field equations. By making use of a…

We define various notions of energy of a set of vertices in a graph, which generalize two of the most widely studied graphical indices: the Wiener index and the Harary index. We provide a new proof of a result due to Douthett and Krantz,…

We study $p$-energies on post critically finite (p.c.f.) self-similar sets for $1<p<\infty$, as limits of discrete $p$-energies on approximation graphs, extending the construction of Dirichlet forms, the $p=2$ setting. By suitably enlarging…

We consider a thin elastic sheet in the shape of a disk whose reference metric is that of a singular cone. I.e., the reference metric is flat away from the center and has a defect there. We define a geometrically fully nonlinear free…

The directed power graph $\mathcal G(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ in which $x\rightarrow y$ if $y$ is a power of $x$, the power graph is the underlying simple graph, and the enhanced power…

The Directed Power Graph of a group is a graph whose vertex set is the elements of the group, with an edge from $x$ to $y$ if $y$ is a power of $x$. The \textit{Power Graph} of a group can be obtained from the directed power graph by…

The power graph $P(G)$ of a finite group $G$ is the undirected simple graph with vertex set $G$, where two elements are adjacent if one is a power of the other. In this paper, the matching numbers of power graphs of finite groups are…

We obtain lower and upper bounds for the maximum weight of a directed cut in the classes of weighted digraphs and weighted acyclic digraphs as well as in some of their subclasses. We compare our results with those obtained for the maximum…

We investigate the existence of ground states with prescribed mass for the Non-Linear Schr\"odinger energy with combined nonlinearities on $1$ and $2$-periodic metric graphs. This is the natural prosecution of previous studies concerning on…

We extend Siu's and Sampson's celebrated rigidity results to non-compact domains. More precisely, let $M$ be a smooth quasi-projective variety with universal cover $\tilde M$ and let $\tilde X$ be a symmetric space of non-compact type, a…

We study the map from conductances to edge energies for harmonic functions on finite graphs with Dirichlet boundary conditions. We prove that for any compatible acyclic orientation and choice of energies there is a unique choice of…

In 2018, Arizmendi and Juarez introduced the concept of energy of a vertex, a novel approach allowing the total energy of a graph to be expressed as the sum of the energies of its individual vertices. In this article, we extend the notion…

The excitations in graphene and some other materials are described by two-dimensional massless Dirac equation with applied external potential of some kind. Solutions of this zero energy equation are built analytically for a wide class of…

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…

Given a group $G$, the enhanced power graph of $G$ denoted by $\mathcal{G}_e(G)$, is the graph with vertex set $G$ and two distinct vertices $x, y$ are edge connected in $\mathcal{G}_e(G)$ if there exists $z\in G $ such that $x=z^m$ and $…

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…

The total energies of a large number of diatomic (or two-center) one-electron $A^{+} B^{+} e^{-}$ ions with unit electrical charges are determined numerically to high accuracy. Based on these results we derive some accurate…

We investigate the existence of ground states for the subcritical NLS energy on metric graphs. In particular, we find out a topological assumption that guarantees the nonexistence of ground states, and give an example in which the…