Displaying similar documents to “Cheeger inequalities for unbounded graph Laplacians”

Curvature on a graph via its geometric spectrum

Paul Baird (2013)

Actes des rencontres du CIRM

Similarity:

We approach the problem of defining curvature on a graph by attempting to attach a ‘best-fit polytope’ to each vertex, or more precisely what we refer to as a configured star. How this should be done depends upon the global structure of the graph which is reflected in its geometric spectrum. Mean curvature is the most natural curvature that arises in this context and corresponds to local liftings of the graph into a suitable Euclidean space. We discuss some examples.

On the strong metric dimension of the strong products of graphs

Dorota Kuziak, Ismael G. Yero, Juan A. Rodríguez-Velázquez (2015)

Open Mathematics

Similarity:

Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exists some shortest u-w path containing v or some shortest v-w path containing u. A set S of vertices is a strong resolving set for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong resolving set for G is called the strong metric dimension of G. It is well known that the problem of computing this invariant is NP-hard. In this...

Stability of graphs.

Demir, Bünyamin, Deniz, Ali, Koçak, Sahin (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Computing the Metric Dimension of a Graph from Primary Subgraphs

Dorota Kuziak, Juan A. Rodríguez-Velázquez, Ismael G. Yero (2017)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G), the representation of u with respect to W is the ordered k-tuple (d(u, w1), d(u, w2), . . . , d(u, wk)), where d(u, wi) denotes the distance between u and wi. The set W is a metric generator for G if every two different vertices of G have distinct representations. A minimum cardinality metric generator is called a metric basis of G and its cardinality is called the metric dimension of...

A rough curvature-dimension condition for metric measure spaces

Anca-Iuliana Bonciocat (2014)

Open Mathematics

Similarity:

We introduce and study a rough (approximate) curvature-dimension condition for metric measure spaces, applicable especially in the framework of discrete spaces and graphs. This condition extends the one introduced by Karl-Theodor Sturm, in his 2006 article On the geometry of metric measure spaces II, to a larger class of (possibly non-geodesic) metric measure spaces. The rough curvature-dimension condition is stable under an appropriate notion of convergence, and stable under discretizations...

Two bounds on the noncommuting graph

Stefano Nardulli, Francesco G. Russo (2015)

Open Mathematics

Similarity:

Erdős introduced the noncommuting graph in order to study the number of commuting elements in a finite group. Despite the use of combinatorial ideas, his methods involved several techniques of classical analysis. The interest for this graph has become relevant during the last years for various reasons. Here we deal with a numerical aspect, showing for the first time an isoperimetric inequality and an analytic condition in terms of Sobolev inequalities. This last result holds in the more...