<p>Let <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(Q(G)=D(G)+A(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>Q</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mi>D</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> <mo>+</mo> <mi>A</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> denote the signless Laplacian matrix (or <i>Q</i>(<i>G</i>)-matrix) of the graph <i>G</i>. Denote by <i>q</i>(<i>G</i>) (or <i>Q</i>(<i>G</i>)-index) the signless Laplacian spectral radius of the graph <i>G</i>. Let <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\theta (l_{1},l_{2},l_{3})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>θ</mi> <mo stretchy="false">(</mo> <msub> <mi>l</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>l</mi> <mn>2</mn> </msub> <mo>,</mo> <msub> <mi>l</mi> <mn>3</mn> </msub> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> denote the theta graph which consists of two vertices connected by three internally disjoint paths with length <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(l_{1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>l</mi> <mn>1</mn> </msub> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(l_{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>l</mi> <mn>2</mn> </msub> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(l_{3}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>l</mi> <mn>3</mn> </msub> </math></EquationSource> </InlineEquation>. For odd <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(n\ge 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(F_{n}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>F</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation> denotes the graph consisting of <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\frac{n-1}{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mfrac> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> <mn>2</mn> </mfrac> </math></EquationSource> </InlineEquation> triangles which intersect in exactly one common vertex. For even <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(n\ge 6\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>6</mn> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(F_{n}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>F</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation> denotes the graph obtained by hanging an edge to the maximal degree vertex of <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(F_{n-1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>F</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </math></EquationSource> </InlineEquation>. In this paper, we firstly show that if <i>G</i> is a <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(\{C_{3},C_{4}\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <msub> <mi>C</mi> <mn>3</mn> </msub> <mo>,</mo> <msub> <mi>C</mi> <mn>4</mn> </msub> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>-free graph with order <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(n\ge 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation> and minimum degree <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(\delta \ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>δ</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, then <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(q(G)\le \frac{n+3}{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>q</mi> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> <mo>≤</mo> <mfrac> <mrow> <mi>n</mi> <mo>+</mo> <mn>3</mn> </mrow> <mn>2</mn> </mfrac> </mrow> </math></EquationSource> </InlineEquation>, unless <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(G\cong C_{5}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>≅</mo> <msub> <mi>C</mi> <mn>5</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>. Secondly, we show that if <i>G</i> is a <InlineEquation ID="IEq19"> <EquationSource Format="TEX">\(\{\theta (1,2,2),F_{5}\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <mi>θ</mi> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>2</mn> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <msub> <mi>F</mi> <mn>5</mn> </msub> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>-free graph with order <InlineEquation ID="IEq20"> <EquationSource Format="TEX">\(n\ge 6\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>6</mn> </mrow> </math></EquationSource> </InlineEquation> and minimum degree <InlineEquation ID="IEq21"> <EquationSource Format="TEX">\(\delta \ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>δ</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, then <InlineEquation ID="IEq22"> <EquationSource Format="TEX">\(q(G)\le n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>q</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> <mo>≤</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation>, unless <InlineEquation ID="IEq23"> <EquationSource Format="TEX">\(G\cong G_{3}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>≅</mo> <msub> <mi>G</mi> <mn>3</mn> </msub> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq24"> <EquationSource Format="TEX">\(n=6\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mn>6</mn> </mrow> </math></EquationSource> </InlineEquation> or <InlineEquation ID="IEq25"> <EquationSource Format="TEX">\(G\cong K_{t,n-t}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>≅</mo> <msub> <mi>K</mi> <mrow> <mi>t</mi> <mo>,</mo> <mi>n</mi> <mo>-</mo> <mi>t</mi> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq26"> <EquationSource Format="TEX">\(n\ge 6\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>6</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq27"> <EquationSource Format="TEX">\(2\le t\le n-2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <mo>≤</mo> <mi>t</mi> <mo>≤</mo> <mi>n</mi> <mo>-</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>. Finally, we show that if <i>G</i> is a <InlineEquation ID="IEq28"> <EquationSource Format="TEX">\(\{\theta (1,2,2),\theta (1,2,3)\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <mi>θ</mi> <mo stretchy="false">(</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>2</mn> <mo stretchy="false">)</mo> <mo>,</mo> <mi>θ</mi> <mo stretchy="false">(</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo stretchy="false">)</mo> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>-free graph with size <InlineEquation ID="IEq29"> <EquationSource Format="TEX">\(m\ge 9\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>≥</mo> <mn>9</mn> </mrow> </math></EquationSource> </InlineEquation> and minimum degree <InlineEquation ID="IEq30"> <EquationSource Format="TEX">\(\delta \ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>δ</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>, then <InlineEquation ID="IEq31"> <EquationSource Format="TEX">\(q(G)\le q(F_{\frac{2m+3}{3}})\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>q</mi> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> <mo>≤</mo> <mi>q</mi> <mrow> <mo stretchy="false">(</mo> <msub> <mi>F</mi> <mfrac> <mrow> <mn>2</mn> <mi>m</mi> <mo>+</mo> <mn>3</mn> </mrow> <mn>3</mn> </mfrac> </msub> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq32"> <EquationSource Format="TEX">\(m=3k, k\ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>=</mo> <mn>3</mn> <mi>k</mi> <mo>,</mo> <mi>k</mi> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>, unless <InlineEquation ID="IEq33"> <EquationSource Format="TEX">\(G\cong F_{\frac{2m+3}{3}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>≅</mo> <msub> <mi>F</mi> <mfrac> <mrow> <mn>2</mn> <mi>m</mi> <mo>+</mo> <mn>3</mn> </mrow> <mn>3</mn> </mfrac> </msub> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

Maxima of the Q-index of graphs with pairs of forbidden subgraphs and minimum degree \(\delta \ge 2\)

  • Yuxiang Liu,
  • Ligong Wang

摘要

Let \(Q(G)=D(G)+A(G)\) Q ( G ) = D ( G ) + A ( G ) denote the signless Laplacian matrix (or Q(G)-matrix) of the graph G. Denote by q(G) (or Q(G)-index) the signless Laplacian spectral radius of the graph G. Let \(\theta (l_{1},l_{2},l_{3})\) θ ( l 1 , l 2 , l 3 ) denote the theta graph which consists of two vertices connected by three internally disjoint paths with length \(l_{1}\) l 1 , \(l_{2}\) l 2 and \(l_{3}\) l 3 . For odd \(n\ge 5\) n 5 , \(F_{n}\) F n denotes the graph consisting of \(\frac{n-1}{2}\) n - 1 2 triangles which intersect in exactly one common vertex. For even \(n\ge 6\) n 6 , \(F_{n}\) F n denotes the graph obtained by hanging an edge to the maximal degree vertex of \(F_{n-1}\) F n - 1 . In this paper, we firstly show that if G is a \(\{C_{3},C_{4}\}\) { C 3 , C 4 } -free graph with order \(n\ge 5\) n 5 and minimum degree \(\delta \ge 2\) δ 2 , then \(q(G)\le \frac{n+3}{2}\) q ( G ) n + 3 2 , unless \(G\cong C_{5}\) G C 5 . Secondly, we show that if G is a \(\{\theta (1,2,2),F_{5}\}\) { θ ( 1 , 2 , 2 ) , F 5 } -free graph with order \(n\ge 6\) n 6 and minimum degree \(\delta \ge 2\) δ 2 , then \(q(G)\le n\) q ( G ) n , unless \(G\cong G_{3}\) G G 3 for \(n=6\) n = 6 or \(G\cong K_{t,n-t}\) G K t , n - t for \(n\ge 6\) n 6 and \(2\le t\le n-2\) 2 t n - 2 . Finally, we show that if G is a \(\{\theta (1,2,2),\theta (1,2,3)\}\) { θ ( 1 , 2 , 2 ) , θ ( 1 , 2 , 3 ) } -free graph with size \(m\ge 9\) m 9 and minimum degree \(\delta \ge 2\) δ 2 , then \(q(G)\le q(F_{\frac{2m+3}{3}})\) q ( G ) q ( F 2 m + 3 3 ) for \(m=3k, k\ge 3\) m = 3 k , k 3 , unless \(G\cong F_{\frac{2m+3}{3}}\) G F 2 m + 3 3 .