Curvature, Geometry and Spectral Properties of Planar Graphs
نویسنده
چکیده
We introduce a curvature function for planar graphs to study the connection of curvature and geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite, locally similar to a tessellation and admits no cut locus. For negative curvature we prove empty interior of minimal bigons and explicit bounds for the growth of distance balls and Cheeger’s constant. The latter yields bounds for the bottom of the spectrum for the discrete Laplace operator. More it leads to a characterization for triviality of essential spectrum by uniform decrease of curvature. Finally we show that non-positive curvature implies absence of finitely supported eigenfunctions for elliptic operators.
منابع مشابه
Cheeger constants, growth and spectrum of locally tessellating planar graphs
In this article, we study relations between the local geometry of planar graphs (combinatorial curvature) and global geometric invariants, namely the Cheeger constants and the exponential growth. We also discuss spectral applications.
متن کاملGeometric and spectral properties of locally tessellating planar graphs
In this article, we derive bounds for values of the global geometry of locally tessellating planar graphs, namely, the Cheeger constant and exponential growth, in terms of combinatorial curvatures. We also discuss spectral implications for the Laplacians.
متن کاملLogarithmic Curvature and Torsion Graphs
This paper introduces logarithmic curvature and torsion graphs for analyzing planar and space curves. We present a method for drawing these graphs from any differentiable parametric curves and clarify the characteristics of these graphs. We show several examples of theses graphs drawn from planar and 3D Bézier curves. From the graphs, we can see some interesting properties of curves that cannot...
متن کاملThe Spectral Radius of A Planar Graph
A decomposition result for planar graphs is used to prove that the spectral radius of a planar graph on n vertices is less than 4 + 3(n 3) Moreover, the spectral radius of an outerplanar graph on n vertices is less than 1 + JZ+&-X
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 46 شماره
صفحات -
تاریخ انتشار 2011