اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConformally Covariant Operators and Conformal Invariants on Weighted Graphs
256
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let G be a finite connected simple graph. We define the moduli space of conformal structures on G. We propose a definition of conformally covariant operators on graphs, motivated by [25]. We provide examples of conformally covariant operators, which include the edge Laplacian and the adjacency matrix on graphs. In the case where such an operator has a nontrivial kernel, we construct conformal invariants, providing discrete counterparts of several results in [11,12] established for Riemannian manifolds. In particular, we show that the nodal sets and nodal domains of null eigenvectors are conformal invariants.
قيم البحث
اقرأ أيضاً
A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble distribution if it is
possible to move a pebble to that vertex using pebbling moves. The pebbling number of a weighted graph is the smallest number $m$ needed to guarantee that any vertex is reachable from any pebble distribution of $m$ pebbles. Regular pebbling problems on unweighted graphs are special cases when the weight on every edge is 2. A regular pebbling problem often simplifies to a pebbling problem on a simpler weighted graph. We present an algorithm to find the pebbling number of weighted graphs. We use this algorithm together with graph simplifications to find the regular pebbling number of all connected graphs with at most nine vertices.
An extension of the well-known Szeged index was introduced recently, named as weighted Szeged index ($textrm{sz}(G)$). This paper is devoted to characterizing the extremal trees and graphs of this new topological invariant. In particular, we proved t
hat the star is a tree having the maximal $textrm{sz}(G)$. Finding a tree with the minimal $textrm{sz}(G)$ is not an easy task to be done. Here, we present the minimal trees up to 25 vertices obtained by computer and describe the regularities which retain in them. Our preliminary computer tests suggest that a tree with the minimal $textrm{sz}(G)$ is also the connected graph of the given order that attains the minimal weighted Szeged index. Additionally, it is proven that among the bipartite connected graphs the complete balanced bipartite graph $K_{leftlfloor n/2rightrfloorleftlceil n/2 rightrceil}$ attains the maximal $textrm{sz}(G)$,. We believe that the $K_{leftlfloor n/2rightrfloorleftlceil n/2 rightrceil}$ is a connected graph of given order that attains the maximum $textrm{sz}(G)$.
We show how to assign to any immersed torus in $R^3$ or $S^3$ a Riemann surface such that the immersion is described by functions defined on this surface. We call this surface the spectrum or the spectral curve of the torus. The spectrum contains imp
ortant information about conformally invariant properties of the torus and, in particular, relates to the Willmore functional. We propose a simple proof that for isothermic tori in $R^3$ (this class includes constant mean curvature tori and tori of revolution) the spectrum is invariant with respect to conformal transformations of $R^3$. We show that the spectral curves of minimal tori in $S^3$ introduced by Hitchin and of constant mean curvature tori in $R^3$ introduced by Pinkall and Sterling are particular cases of this general spectrum. The construction is based on the Weierstrass representation of closed surfaces in $R^3$ and the construction of the Floquet--Bloch varieties of periodic differential operators.
Let $G$ be a graph, and let $w$ be a positive real-valued weight function on $V(G)$. For every subset $S$ of $V(G)$, let $w(S)=sum_{v in S} w(v).$ A non-empty subset $S subset V(G)$ is a weighted safe set of $(G,w)$ if, for every component $C$ of the
subgraph induced by $S$ and every component $D$ of $G-S$, we have $w(C) geq w(D)$ whenever there is an edge between $C$ and $D$. If the subgraph of $G$ induced by a weighted safe set $S$ is connected, then the set $S$ is called a connected weighted safe set of $(G,w)$. The weighted safe number $mathrm{s}(G,w)$ and connected weighted safe number $mathrm{cs}(G,w)$ of $(G,w)$ are the minimum weights $w(S)$ among all weighted safe sets and all connected weighted safe sets of $(G,w)$, respectively. Note that for every pair $(G,w)$, $mathrm{s}(G,w) le mathrm{cs}(G,w)$ by their definitions. Recently, it was asked which pair $(G,w)$ satisfies the equality and shown that every weighted cycle satisfies the equality. In this paper, we give a complete list of connected bipartite graphs $G$ such that $mathrm{s}(G,w)=mathrm{cs}(G,w)$ for every weight function $w$ on $V(G)$.
Let $D=(G,mathcal{O},w)$ be a weighted oriented graph whose edge ideal is $I(D)$. In this paper, we characterize the unmixed property of $I(D)$ for each one of the following cases: $G$ is an $SCQ$ graph; $G$ is a chordal graph; $G$ is a simplicial gr
aph; $G$ is a perfect graph; $G$ has no $4$- or $5$-cycles; $G$ is a graph without $3$- and $5$-cycles; and ${rm girth}(G)geqslant 5$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
