Gromov hyperbolicity in the Cartesian sum of graphs
From MaRDI portal
Publication:1734079
DOI10.1007/s41980-018-0055-4zbMath1409.05170OpenAlexW2595181894MaRDI QIDQ1734079
José M. Rodríguez, Walter Carballosa, Amauris de la Cruz
Publication date: 22 March 2019
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41980-018-0055-4
Combinatorial inequalities (05A20) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hyperbolicity of bipartite graphs and intersection graphs
- Gromov hyperbolicity in Cartesian product graphs
- Gromov hyperbolic graphs
- Gromov hyperbolicity in strong product graphs
- Gromov hyperbolic cubic graphs
- Lack of Gromov-hyperbolicity in small-world networks
- Hyperbolicity in the corona and join of graphs
- Counting subgraphs in hyperbolic graphs with symmetry
- Resolvability and strong resolvability in the direct product of graphs
- Graphs and Gromov hyperbolicity of non-constant negatively curved surfaces
- Hyperbolicity and chordality of a graph
- On the hyperbolicity constant in graphs
- On the hyperbolicity constant of line graphs
- Hyperbolicity and complement of graphs
- Chordality properties and hyperbolicity on graphs
- Artin groups of finite type are biautomatic
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
- Coloring the Cartesian sum of graphs
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- Gromov hyperbolicity in lexicographic product graphs
- Hyperbolic bridged graphs
- On the strong metric dimension of the strong products of graphs
- Computing the Gromov hyperbolicity of a discrete metric space
- Computing the hyperbolicity constant
- Associative graph products and their independence, domination and coloring numbers
- On Computing the Gromov Hyperbolicity
- Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs
- Core congestion is inherent in hyperbolic networks
- Metric Embedding, Hyperbolic Space, and Social Networks
- Traffic Congestion in Expanders and (p,δ)–Hyperbolic Spaces
- On the hyperbolicity of edge-chordal and path-chordal graphs
- Non-Hyperbolicity of Random Graphs with Given Expected Degrees
- On the hyperbolicity of chordal graphs
- Graph homotopy and Graham homotopy
This page was built for publication: Gromov hyperbolicity in the Cartesian sum of graphs
