Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Weakly Modular Graphs and Nonpositive Curvature

View through CrossRef
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying themes of our investigation are various “nonpositive curvature" and “local-to-global” properties and characterizations of weakly modular graphs and their subclasses. Weakly modular graphs have been introduced as a far-reaching common generalization of median graphs (and more generally, of modular and orientable modular graphs), Helly graphs, bridged graphs, and dual polar graphs occurring under different disguises ( 1 1 –skeletons, collinearity graphs, covering graphs, domains, etc.) in several seemingly-unrelated fields of mathematics: Metric graph theory Geometric group theory Incidence geometries and buildings Theoretical computer science and combinatorial optimization We give a local-to-global characterization of weakly modular graphs and their subclasses in terms of simple connectedness of associated triangle-square complexes and specific local combinatorial conditions. In particular, we revisit characterizations of dual polar graphs by Cameron and by Brouwer-Cohen. We also show that (disk-)Helly graphs are precisely the clique-Helly graphs with simply connected clique complexes. With l 1 l_1 –embeddable weakly modular and sweakly modular graphs we associate high-dimensional cell complexes, having several strong topological and geometrical properties (contractibility and the CAT(0) property). Their cells have a specific structure: they are basis polyhedra of even △ \triangle –matroids in the first case and orthoscheme complexes of gated dual polar subgraphs in the second case. We resolve some open problems concerning subclasses of weakly modular graphs: we prove a Brady-McCammond conjecture about CAT(0) metric on the orthoscheme complexes of modular lattices; we answer Chastand’s question about prime graphs for pre-median graphs. We also explore negative curvature for weakly modular graphs.
Title: Weakly Modular Graphs and Nonpositive Curvature
Description:
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them.
The unifying themes of our investigation are various “nonpositive curvature" and “local-to-global” properties and characterizations of weakly modular graphs and their subclasses.
Weakly modular graphs have been introduced as a far-reaching common generalization of median graphs (and more generally, of modular and orientable modular graphs), Helly graphs, bridged graphs, and dual polar graphs occurring under different disguises ( 1 1 –skeletons, collinearity graphs, covering graphs, domains, etc.
) in several seemingly-unrelated fields of mathematics: Metric graph theory Geometric group theory Incidence geometries and buildings Theoretical computer science and combinatorial optimization We give a local-to-global characterization of weakly modular graphs and their subclasses in terms of simple connectedness of associated triangle-square complexes and specific local combinatorial conditions.
In particular, we revisit characterizations of dual polar graphs by Cameron and by Brouwer-Cohen.
We also show that (disk-)Helly graphs are precisely the clique-Helly graphs with simply connected clique complexes.
With l 1 l_1 –embeddable weakly modular and sweakly modular graphs we associate high-dimensional cell complexes, having several strong topological and geometrical properties (contractibility and the CAT(0) property).
Their cells have a specific structure: they are basis polyhedra of even △ \triangle –matroids in the first case and orthoscheme complexes of gated dual polar subgraphs in the second case.
We resolve some open problems concerning subclasses of weakly modular graphs: we prove a Brady-McCammond conjecture about CAT(0) metric on the orthoscheme complexes of modular lattices; we answer Chastand’s question about prime graphs for pre-median graphs.
We also explore negative curvature for weakly modular graphs.

Related Results

Study on the myopia control effect of OK lens on children with different corneal curvature
Study on the myopia control effect of OK lens on children with different corneal curvature
Abstract Objective: To explore the effect of OK lens on myopia control in children with different corneal curvature. Method: A total of 178 myopic children admitted to our...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Nanoscale membrane curvature sorts lipid phases and alters lipid diffusion
Nanoscale membrane curvature sorts lipid phases and alters lipid diffusion
Abstract The precise spatiotemporal control of nanoscale membrane shape and composition is the result of complex interplay of individual and collective molecular be...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...

Back to Top