中文
相关论文

相关论文: A note on Steinerberger's curvature for graphs

200 篇论文

This is a survey article on recent progress of comparison geometry and geometric analysis on Finsler manifolds of weighted Ricci curvature bounded below. Our purpose is two-fold: Give a concise and geometric review on the birth of weighted…

微分几何 · 数学 2022-06-22 Shin-ichi Ohta

In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…

组合数学 · 数学 2026-03-09 Patrizio Bifulco , Joachim Kerner

Based on two classical notions of curvature for curves in general metric spaces, namely the Menger and Haantjes curvatures, we introduce new definitions of sectional, Ricci and scalar curvature for networks and their higher dimensional…

度量几何 · 数学 2019-10-15 Emil Saucan , Areejit Samal , Jürgen Jost

Starting from pointwise gradient estimates for the heat semigroup, we study three characterizations of weak lower curvature bounds on metric graphs. More precisely, we prove the equivalence between a weak notion of the Bakry-\'Emery…

偏微分方程分析 · 数学 2025-12-18 Juliane Krautz

The aim of this paper is to give two uniqueness results for the Dirichlet problem associated to the constant mean curvature equation. We study constant mean curvature graphs over strips of R^2. The proofs are based on height estimates and…

微分几何 · 数学 2007-05-23 Laurent Mazet

In this short note we discuss some recent results about two-positive Ricci curvature and their applications to positive Einstein curvature.

微分几何 · 数学 2017-04-07 Mohammed Larbi Labbi

It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…

组合数学 · 数学 2023-07-25 Sarah Griffith

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…

计算几何 · 计算机科学 2012-03-28 Sergio Cabello , Bojan Mohar

In this note we present some abstract ideas how one can construct spaces from building blocks according to a graph. The coupling is expressed via boundary pairs, and can be applied to very different spaces such as discrete graphs, quantum…

谱理论 · 数学 2016-03-31 Olaf Post

The bridge index and superbridge index of a knot are important invariants in knot theory. We define the bridge map of a knot conformation, which is closely related to these two invariants, and interpret it in terms of the tangent indicatrix…

We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…

量子代数 · 数学 2014-10-01 Adam S. Sikora , Bruce W. Westbury

In this paper, we investigate how the Wiener index of unicyclic graphs varies with graph operations. These results are used to present a sharp lower bound for the Wiener index of unicyclic graphs of order $n$ with girth and the matching…

组合数学 · 数学 2011-03-01 Ya-Hong Chen , Xiao-Dong Zhang

The Steiner ratio characterizes the greatest possible deviation of the length of a minimal spanning tree from the length of the minimal Steiner tree. In this paper, estimates of the Steiner ratio on Riemannian manifolds are obtained. As a…

度量几何 · 数学 2011-01-18 D. Cieslik , A. O. Ivanov , A. A. Tuzhilin

Meier and Zupan showed that every surface in the four-sphere admits a bridge trisection and can therefore be represented by three simple tangles. This raises the possibility of applying methods from link homology to knotted surfaces. We use…

几何拓扑 · 数学 2019-09-20 Adam Saltz

Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The sum of all Steiner distances on sets of size $k$ is called the…

组合数学 · 数学 2018-10-01 Matjaž Kovše , Rasila V A , Ambat Vijayakumar

Traditionally, network analysis is based on local properties of vertices, like their degree or clustering, and their statistical behavior across the network in question. This paper develops an approach which is different in two respects. We…

组合数学 · 数学 2016-10-12 Melanie Weber , Emil Saucan , Jürgen Jost

Using Schauder's theory for linear elliptic partial differential equations in two independent variables and fundamental estimates for univalent mappings due to E. Heinz we establish an upper bound of the Gaussian curvature of…

微分几何 · 数学 2007-05-23 Steffen Froehlich

We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…

组合数学 · 数学 2011-01-18 Matthias Keller

On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…

组合数学 · 数学 2020-02-11 Yohji Akama , Bobo Hua , Yanhui Su , Haohang Zhang

We introduce new definitions of sectional, Ricci and scalar curvature for networks and their higher dimensional counterparts, derived from two classical notions of curvature for curves in general metric spaces, namely, the Menger curvature…

度量几何 · 数学 2020-09-10 Emil Saucan , Areejit Samal , Jürgen Jost