<p>Distance-biregular graphs form a natural bipartite generalization of distance-regular graphs. Among them, the class of 2-<i>Y</i>-homogeneous distance-biregular graphs plays a prominent role and has been the subject of several recent classification efforts. In this paper, we complete the classification of 2-<i>Y</i>-homogeneous <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\((Y,Y')\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>Y</mi> <mo>,</mo> <msup> <mi>Y</mi> <mo>′</mo> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>-distance-biregular graphs with eccentricity <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(D=4\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>D</mi> <mo>=</mo> <mn>4</mn> </mrow> </math></EquationSource> </InlineEquation>. Building on earlier work that settled the cases <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(c_2'=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>c</mi> <mn>2</mn> <mo>′</mo> </msubsup> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(c_2'=2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>c</mi> <mn>2</mn> <mo>′</mo> </msubsup> <mo>=</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, we address the remaining open case <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(c_2'\ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>c</mi> <mn>2</mn> <mo>′</mo> </msubsup> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>. We prove that no such graphs exist, thereby resolving an open problem posed in previous work and closing the classification program for eccentricity <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(D=4\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>D</mi> <mo>=</mo> <mn>4</mn> </mrow> </math></EquationSource> </InlineEquation>. Our approach combines a detailed analysis of intersection numbers, arithmetic constraints arising from 2-<i>Y</i>-homogeneity, and structural properties of distance-biregular graphs. As a consequence, we obtain a complete characterization of all 2-<i>Y</i>-homogeneous distance-biregular graphs with <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(D=4\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>D</mi> <mo>=</mo> <mn>4</mn> </mrow> </math></EquationSource> </InlineEquation>, and we further conclude that every 2-<i>Y</i>-homogeneous distance-biregular graph with <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(c_2'\ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mi>c</mi> <mn>2</mn> <mo>′</mo> </msubsup> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation> must necessarily have eccentricity <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(D=3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>D</mi> <mo>=</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

On 2-Y-homogeneous \((Y,Y')\)-distance-biregular graphs with \(D=4\)

  • Blas Fernández,
  • Marija Maksimović,
  • Safet Penjić,
  • Sanja Rukavina

摘要

Distance-biregular graphs form a natural bipartite generalization of distance-regular graphs. Among them, the class of 2-Y-homogeneous distance-biregular graphs plays a prominent role and has been the subject of several recent classification efforts. In this paper, we complete the classification of 2-Y-homogeneous \((Y,Y')\) ( Y , Y ) -distance-biregular graphs with eccentricity \(D=4\) D = 4 . Building on earlier work that settled the cases \(c_2'=1\) c 2 = 1 and \(c_2'=2\) c 2 = 2 , we address the remaining open case \(c_2'\ge 3\) c 2 3 . We prove that no such graphs exist, thereby resolving an open problem posed in previous work and closing the classification program for eccentricity \(D=4\) D = 4 . Our approach combines a detailed analysis of intersection numbers, arithmetic constraints arising from 2-Y-homogeneity, and structural properties of distance-biregular graphs. As a consequence, we obtain a complete characterization of all 2-Y-homogeneous distance-biregular graphs with \(D=4\) D = 4 , and we further conclude that every 2-Y-homogeneous distance-biregular graph with \(c_2'\ge 3\) c 2 3 must necessarily have eccentricity \(D=3\) D = 3 .