Pseudo-modular graphs (Q1084416)

A graph is called pseudo-modular if, given any three vertices u, v, w, there are shortest uv-, uw- and vw-paths either passing through a vertex or pairwise sharing edges of a triangle. Cycles of length \(>4\), the so- called 'house' graph and the '3-sun' graph are examples of graphs that are not pseudo-modular. Now pseudo-modular graphs cannot be characterized by forbidden subgraphs since every graph can be embedded in a pseudo- modular graph. However, suppose that an induced subgraph H of a graph G is called isometric if every shortest path in H is also a shortest path in G, and call G hereditary pseudo-similar if every isometric subgraph of G is pseudo-similar. Then one of the results in this paper is that if G does not contain a house, a 3-sun or a cycle of length \(>4\) as an isometric subgraph then G is hereditary pseudo-similar.