On prescribed Hamilton laceability of hybrid-faulty star graphs

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2025-06-15 Epub Date: 2025-02-27 DOI:10.1016/j.dam.2025.02.018
Zai Ping Lu, Shu Dan Xue
{"title":"On prescribed Hamilton laceability of hybrid-faulty star graphs","authors":"Zai Ping Lu,&nbsp;Shu Dan Xue","doi":"10.1016/j.dam.2025.02.018","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we investigate Hamilton paths passing through a prescribed linear forest in a hybrid-faulty star graph. Let <span><math><mi>M</mi></math></span> be a matching with <span><math><mi>m</mi></math></span> edges of the star graph <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, <span><math><mi>F</mi></math></span> be an <span><math><mi>f</mi></math></span>-subset of <span><math><mrow><mi>E</mi><mrow><mo>(</mo><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>V</mi><mrow><mo>(</mo><mi>M</mi><mo>)</mo></mrow><mo>)</mo></mrow></mrow></math></span>, <span><math><mrow><mo>{</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>}</mo></mrow></math></span> be a 2-subset of <span><math><mrow><mi>V</mi><mrow><mo>(</mo><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>V</mi><mrow><mo>(</mo><mi>M</mi><mo>)</mo></mrow><mo>)</mo></mrow></mrow></math></span>, and <span><math><mi>L</mi></math></span> be a linear forest of <span><math><mrow><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>V</mi><mrow><mo>(</mo><mi>M</mi><mo>)</mo></mrow><mo>−</mo><mi>F</mi></mrow></math></span>. Suppose that <span><math><mrow><mi>m</mi><mo>+</mo><mi>f</mi><mo>≤</mo><mi>n</mi><mo>−</mo><mn>4</mn></mrow></math></span>, neither <span><math><mi>x</mi></math></span> nor <span><math><mi>y</mi></math></span> is an inner vertex of <span><math><mi>L</mi></math></span>, and <span><math><mrow><mi>x</mi><mo>,</mo><mi>y</mi></mrow></math></span> are not located on the same component of <span><math><mi>L</mi></math></span>. We prove that, for any <span><math><mrow><mi>w</mi><mo>∈</mo><mi>V</mi><mrow><mo>(</mo><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>V</mi><mrow><mo>(</mo><mi>M</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>∖</mo><mi>V</mi><mrow><mo>(</mo><mi>L</mi><mo>)</mo></mrow></mrow></math></span>, there exists a Hamilton path of <span><math><mrow><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>V</mi><mrow><mo>(</mo><mi>M</mi><mo>)</mo></mrow><mo>−</mo><mi>F</mi><mo>−</mo><mi>w</mi></mrow></math></span> between <span><math><mi>x</mi></math></span> and <span><math><mi>y</mi></math></span> passing through <span><math><mi>L</mi></math></span> provided that <span><math><mrow><mi>x</mi><mo>,</mo><mi>y</mi></mrow></math></span> belong to the partite set not containing <span><math><mi>w</mi></math></span>, and <span><math><mrow><mrow><mo>|</mo><mi>E</mi><mrow><mo>(</mo><mi>L</mi><mo>)</mo></mrow><mo>|</mo></mrow><mo>≤</mo><mi>n</mi><mo>−</mo><mn>4</mn><mo>−</mo><mi>m</mi><mo>−</mo><mi>f</mi></mrow></math></span>. As a consequence, if <span><math><mrow><mi>x</mi><mo>,</mo><mi>y</mi></mrow></math></span> are from opposite partite sets and <span><math><mrow><mrow><mo>|</mo><mi>E</mi><mrow><mo>(</mo><mi>L</mi><mo>)</mo></mrow><mo>|</mo></mrow><mo>≤</mo><mi>n</mi><mo>−</mo><mn>4</mn><mo>−</mo><mi>m</mi><mo>−</mo><mi>f</mi></mrow></math></span> then <span><math><mrow><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>V</mi><mrow><mo>(</mo><mi>M</mi><mo>)</mo></mrow><mo>−</mo><mi>F</mi></mrow></math></span> has a Hamilton path between <span><math><mi>x</mi></math></span> and <span><math><mi>y</mi></math></span> passing through <span><math><mi>L</mi></math></span>. We also proved that <span><math><mrow><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mi>V</mi><mrow><mo>(</mo><mi>M</mi><mo>)</mo></mrow><mo>−</mo><mi>F</mi></mrow></math></span> has a Hamilton cycle passing through <span><math><mi>L</mi></math></span> if <span><math><mrow><mi>m</mi><mo>+</mo><mi>f</mi><mo>≤</mo><mi>n</mi><mo>−</mo><mn>3</mn></mrow></math></span> and <span><math><mrow><mrow><mo>|</mo><mi>E</mi><mrow><mo>(</mo><mi>L</mi><mo>)</mo></mrow><mo>|</mo></mrow><mo>≤</mo><mi>n</mi><mo>−</mo><mn>3</mn><mo>−</mo><mi>m</mi><mo>−</mo><mi>f</mi></mrow></math></span>.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"368 ","pages":"Pages 72-81"},"PeriodicalIF":1.0000,"publicationDate":"2025-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25000903","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/27 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we investigate Hamilton paths passing through a prescribed linear forest in a hybrid-faulty star graph. Let M be a matching with m edges of the star graph Sn, F be an f-subset of E(SnV(M)), {x,y} be a 2-subset of V(SnV(M)), and L be a linear forest of SnV(M)F. Suppose that m+fn4, neither x nor y is an inner vertex of L, and x,y are not located on the same component of L. We prove that, for any wV(SnV(M))V(L), there exists a Hamilton path of SnV(M)Fw between x and y passing through L provided that x,y belong to the partite set not containing w, and |E(L)|n4mf. As a consequence, if x,y are from opposite partite sets and |E(L)|n4mf then SnV(M)F has a Hamilton path between x and y passing through L. We also proved that SnV(M)F has a Hamilton cycle passing through L if m+fn3 and |E(L)|n3mf.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
混合缺陷星图的规定Hamilton可缺性
本文研究了混合缺陷星图中Hamilton路径穿过给定线性森林的问题。设M是星图Sn的M条边的匹配,F是E(Sn−V(M))的一个F子集,{x,y}是V(Sn−V(M))的一个2子集,L是Sn−V(M)−F的一个线性森林。设m+f≤n−4,x和y都不是L的内顶点,且x、y不在L的同一分量上,证明了对于任意w∈V(Sn−V(m))∈V(L),只要x、y属于不含w的部集,且|E(L)|≤n−4−m−f,则在x和y经过L之间存在一条Sn−V(m)−f−w的Hamilton路径。因此,如果x,y是相对部集,且|E(L)|≤n−4−m−f,则Sn−V(m)−f在x和y之间有汉密尔顿路径通过L。我们还证明了如果m+f≤n−3,|E(L)|≤n−3−m−f, Sn−V(m)−f有汉密尔顿环通过L。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
期刊最新文献
Order and chain polytopes of maximal ranked posets A note on distance-hereditary graphs whose complement is also distance-hereditary The 3-restricted edge-connectivity of the direct product graphs A polyhedral study of a relaxation of the routing and spectrum allocation problem On sufficient degree conditions for a graph to be disjoint path coverable
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1