<p>Weakly modular graphs are defined as the class of graphs that satisfy the <i>triangle condition (TC)</i> and the <i>quadrangle condition (QC)</i>. We study an interesting subclass of weakly modular graphs that satisfies a stronger version of the triangle condition, known as the <i>triangle diamond condition (TDC)</i> and term this subclass of weakly modular graphs as the <i>diamond-weakly modular graphs</i>. It is observed that this class contains the class of modular graphs and the class of weakly bridged graphs. The interval function <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(I_G\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>I</mi> <mi>G</mi> </msub> </math></EquationSource> </InlineEquation> of a connected graph <i>G</i> with vertex set <i>V</i> is an important concept in metric graph theory and is one of the prime examples of a transit function; a set function defined on the Cartesian product <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(V\times V\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>V</mi> <mo>×</mo> <mi>V</mi> </mrow> </math></EquationSource> </InlineEquation> to the power set of <i>V</i> satisfying the expansive, symmetric, and idempotent axioms. In this paper, we derive an interesting axiom denoted as <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\((J0')\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>J</mi> <msup> <mn>0</mn> <mo>′</mo> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, obtained from a well-known axiom introduced by Marlow Sholander in 1952, denoted as (<i>J</i>0). It is proved that the axiom <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\((J0')\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>J</mi> <msup> <mn>0</mn> <mo>′</mo> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> 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 <i>R</i> and prove that an arbitrary transit function becomes the interval function of a diamond-weakly modular graph if and only if <i>R</i> satisfies these betweenness axioms. Similar characterizations are obtained for the interval function of bridged graphs and weakly bridged graphs.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Weakly Modular Graphs with Diamond Condition, the Interval Function and Axiomatic Characterizations

  • Lekshmi Kamal K. Sheela,
  • Jeny Jacob,
  • Manoj Changat

摘要

Weakly modular graphs are defined as the class of graphs that satisfy the triangle condition (TC) and the quadrangle condition (QC). We study an interesting subclass of weakly modular graphs that satisfies a stronger version of the triangle condition, known as the triangle diamond condition (TDC) and term this subclass of weakly modular graphs as the diamond-weakly modular graphs. It is observed that this class contains the class of modular graphs and the class of weakly bridged graphs. The interval function \(I_G\) 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 examples of a transit function; a set function defined on the Cartesian product \(V\times V\) V × 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')\) ( J 0 ) , obtained from a well-known axiom introduced by Marlow Sholander in 1952, denoted as (J0). It is proved that the axiom \((J0')\) ( J 0 ) 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.