The hyperbolicity constant of infinite circulant graphs
From MaRDI portal
Publication:2364774
Recommendations
Cites work
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Algorithms and Computation
- Artin groups of finite type are biautomatic
- Asymptotic modularity of some graph classes
- Characterizing hyperbolic spaces and real trees
- Chordality properties and hyperbolicity on graphs
- Clustering coefficients of large networks
- Computing the Gromov hyperbolicity of a discrete metric space
- Computing the hyperbolicity constant
- Core congestion is inherent in hyperbolic networks
- Cosmological networks
- Counting subgraphs in hyperbolic graphs with symmetry
- Graph homotopy and Graham homotopy
- Graphs and Gromov hyperbolicity of non-constant negatively curved surfaces
- Gromov hyperbolic cubic graphs
- Gromov hyperbolic graphs
- Gromov hyperbolicity in Cartesian product graphs
- scientific article; zbMATH DE number 1054724 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 849252 (Why is no real title available?)
- scientific article; zbMATH DE number 849253 (Why is no real title available?)
- scientific article; zbMATH DE number 848089 (Why is no real title available?)
- Hyperbolic bridged graphs
- Hyperbolicity and chordality of a graph
- Hyperbolicity and complement of graphs
- Hyperbolicity and parameters of graphs.
- Kähler hyperbolicity and \(L_ 2\)-Hodge theory
- Lack of Gromov-hyperbolicity in colored random networks
- Lack of Gromov-hyperbolicity in small-world networks
- Lack of hyperbolicity in asymptotic Erdős-Renyi sparse random graphs
- Metric embedding, hyperbolic space, and social networks
- New binary coding results by circulants
- Non-hyperbolicity of random graphs with given expected degrees
- Notes on diameters, centers, and approximating trees of -hyperbolic geodesic spaces and graphs
- On computing the Gromov hyperbolicity
- On the hyperbolicity constant in graphs
- On the hyperbolicity constant of line graphs
- On the hyperbolicity of bipartite graphs and intersection graphs
- On the hyperbolicity of chordal graphs
- On the hyperbolicity of edge-chordal and path-chordal graphs
- Packing and Covering δ-Hyperbolic Spaces by Balls
- Proximity algorithms for nearly-doubling spaces
- Recognition of C₄-free and 1/2-hyperbolic graphs
- Reliable circulant networks with minimum transmission delay
- Scaled Gromov four-point condition for network graph curvature computation
- Small values of the hyperbolicity constant in graphs
- Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition
- Stability of Gromov hyperbolicity
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Traffic congestion in expanders and (p, )-hyperbolic spaces
- Tree decompositions and social graphs
Cited in
(4)
This page was built for publication: The hyperbolicity constant of infinite circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364774)
