On regular graphs with a tree of diameter 3 as a star complement

IF 0.7 3区数学 Q2 MATHEMATICS Discrete Mathematics Pub Date : 2025-03-17 DOI:10.1016/j.disc.2025.114488

Peter Rowlinson , Zoran Stanić

{"title":"On regular graphs with a tree of diameter 3 as a star complement","authors":"Peter Rowlinson , Zoran Stanić","doi":"10.1016/j.disc.2025.114488","DOIUrl":null,"url":null,"abstract":"<div><div>We investigate the regular graphs with a star complement H which is a tree of diameter 3. Thus H is a double star <math><mi>D</mi><mo>(</mo><mi>m</mi><mo>,</mo><mi>n</mi><mo>)</mo></math>, i.e. a tree with two vertices of degree m and n greater than 1, and all other vertices of degree 1. We determine all the regular graphs G that arise when either (a) <math><mi>μ</mi><mo>∈</mo><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></math> or (b) <math><mi>m</mi><mo>=</mo><mi>n</mi></math> and μ is an integer less than −1. It is also proved that for <math><mi>m</mi><mo>=</mo><mi>n</mi></math> and <math><mi>μ</mi><mo>≥</mo><mn>2</mn></math>, the degree of G must be n; moreover,<math><mi>n</mi><mo>≥</mo><mfrac><mrow><mi>μ</mi><mo>(</mo><mi>μ</mi><mo>(</mo><mn>2</mn><mi>μ</mi><mo>(</mo><mi>μ</mi><mo>+</mo><mn>1</mn><mo>)</mo><mo>−</mo><mn>3</mn><mo>)</mo><mo>+</mo><mn>3</mn><mo>)</mo><mo>−</mo><mn>1</mn></mrow><mrow><mn>2</mn><mi>μ</mi><mo>−</mo><mn>1</mn></mrow></mfrac><mo>,</mo></math> when μ is an integer.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 8","pages":"Article 114488"},"PeriodicalIF":0.7000,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X25000962","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

Abstract

We investigate the regular graphs with a star complement H which is a tree of diameter 3. Thus H is a double star

D (m, n)

, i.e. a tree with two vertices of degree m and n greater than 1, and all other vertices of degree 1. We determine all the regular graphs G that arise when either (a)

μ \in {0, 1}

or (b)

m = n

and μ is an integer less than −1. It is also proved that for

m = n

and

μ \geq 2

, the degree of G must be n; moreover,

n \geq \frac{μ (μ (2 μ (μ + 1) - 3) + 3) - 1}{2 μ - 1},

when μ is an integer.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

求助全文

约1分钟内获得全文去求助

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.

期刊最新文献

Cyclic balanced sampling plans avoiding adjacent units with block size four On regular graphs with a tree of diameter 3 as a star complement Pentavalent 2-regular core-free Cayley graphs Claw-free cubic graphs are (1,1,2,2)-colorable Triangular faces of the order and chain polytope of a maximal ranked poset