Hyperbolicity in the corona and join of graphs
From MaRDI portal
Publication:499645
DOI10.1007/s00010-014-0324-0zbMath1321.05170arXiv1410.2938OpenAlexW2036017360MaRDI QIDQ499645
José M. Rodríguez, Walter Carballosa, José María Sigarreta-Almira
Publication date: 30 September 2015
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.2938
Combinatorial inequalities (05A20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Infinite graphs (05C63)
Related Items (11)
Mathematical properties of the hyperbolicity of circulant networks ⋮ Characterization of the hyperbolicity in the lexicographic product ⋮ Bounds on Gromov hyperbolicity constant ⋮ Unnamed Item ⋮ On a classical theorem on the diameter and minimum degree of a graph ⋮ Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant ⋮ Geometric and topological properties of the complementary prism networks ⋮ Gromov hyperbolicity in lexicographic product graphs ⋮ On the hyperbolicity constant in graph minors ⋮ Gromov hyperbolicity in the Cartesian sum of graphs ⋮ Gromov hyperbolicity in Mycielskian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gromov hyperbolicity in Cartesian product graphs
- Coloring, location and domination of corona graphs
- Gromov hyperbolic graphs
- Gromov hyperbolicity in strong product graphs
- Gromov hyperbolic cubic graphs
- On the hyperbolicity constant in graphs
- On the hyperbolicity constant of line graphs
- Hyperbolicity and complement of graphs
- Small values of the hyperbolicity constant in graphs
- Artin groups of finite type are biautomatic
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Gromov hyperbolicity in lexicographic product graphs
- On the strong metric dimension of corona product graphs and join graphs
- Hyperbolicity in median graphs
- Computing the hyperbolicity constant
- Characterization of Gromov hyperbolic short graphs
- On the corona of two graphs
- The Join of Graphs and Crossing Numbers
- Packing and Covering δ-Hyperbolic Spaces by Balls
- On the join of graphs and chromatic uniqueness
- Algorithms and Computation
- On the hyperbolicity of chordal graphs
- Graph homotopy and Graham homotopy
This page was built for publication: Hyperbolicity in the corona and join of graphs
