Papers
Topics
Authors
Recent
Search
2000 character limit reached

Weakly modular graphs with diamond condition, the interval function and axiomatic characterizations

Published 4 Mar 2024 in math.CO and cs.DM | (2403.01771v1)

Abstract: Weakly modular graphs are defined as the class of graphs that satisfy the \emph{triangle condition ($TC$)} and the \emph{quadrangle condition ($QC$)}. We study an interesting subclass of weakly modular graphs that satisfies a stronger version of the triangle condition, known as the \emph{triangle diamond condition ($TDC$)}. and term this subclass of weakly modular graphs as the \emph{diamond-weakly modular graphs}. It is observed that this class contains the class of bridged graphs and the class of weakly bridged graphs. The interval function $I_G$ of a connected graph $G$ with vertex set $V$ is an important concept in metric graph theory and is one of the prime example of a transit function; a set function defined on the Cartesian product $V\times V$ to the power set of $V$ satisfying the expansive, symmetric and idempotent axioms. In this paper, we derive an interesting axiom denoted as $(J0')$, obtained from a well-known axiom introduced by Marlow Sholander in 1952, denoted as $(J0)$. It is proved that the axiom $(J0')$ is a characterizing axiom of the diamond-weakly modular graphs. We propose certain types of independent first-order betweenness axioms on an arbitrary transit function $R$ and prove that an arbitrary transit function becomes the interval function of a diamond-weakly modular graph if and only if $R$ satisfies these betweenness axioms. Similar characterizations are obtained for the interval function of bridged graphs and weakly bridged graphs.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (8)
  1. H.M. Mulder The Interval function of a GraphMC Tract 132 Mathematisch Centrum, Amsterdam 1980
  2. H.M. Mulder, L. Nebeský Axiomatic characterization of the interval function of a graph European J. Combin 30 2009 1172–1185
  3. L. Nebeský A characterization of the interval function of a connected graph Czech. Math. J. 44 1994 173–178
  4. L. Nebeský A characterization of the set of all shortest paths in a connected graph Mathematica Bohemica 119.1 1994 15–20
  5. L. Nebeský A characterization of geodetic graphs Czech. Math. J. 45.3 1995 491–493
  6. L. Nebeský Characterizing the interval function of a connected graph Math. Bohem. 123.2 1998 137–144
  7. L. Nebeský A new proof of a characterization of the set of all geodesics in a connected graphCzech. Math. J.48.41998809–813
  8. L. Nebeský Characterization of the interval function of a (finite or infinite) connected graphCzech. Math. J. 51 2001 635–642

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.