图的 K1,2 结构连通性

Xiao Zhao, Haojie Zheng, Hengzhe Li
{"title":"图的 K1,2 结构连通性","authors":"Xiao Zhao, Haojie Zheng, Hengzhe Li","doi":"10.1007/s11227-024-06390-5","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we focus on examining the <span>\\(K_{1,2}\\)</span>-structure-connectivity of any connected graph. Let <i>G</i> be a connected graph with <i>n</i> vertices, we show that <span>\\(\\kappa (G; K_{1,2})\\)</span> is well defined if <span>\\(\\hbox {diam}(G)\\ge 4\\)</span>, or <span>\\(n\\equiv 1\\pmod 3\\)</span>, or <span>\\(G\\notin \\{C_{5},K_{n}\\}\\)</span> when <span>\\(n\\equiv 2\\pmod 3\\)</span>, or there exist three vertices <i>u</i>, <i>v</i>, <i>w</i> such that <span>\\(N_{G}(u)\\cap (N_{G}(\\{v,w\\})\\cup \\{v,w\\})=\\emptyset\\)</span> when <span>\\(n\\equiv 0\\pmod 3\\)</span>. Furthermore, if <i>G</i> has <span>\\(K_{1,2}\\)</span>-structure-cut, we prove <span>\\(\\kappa (G)/3\\le \\kappa (G; K_{1,2})\\le \\kappa (G)\\)</span>.</p>","PeriodicalId":501596,"journal":{"name":"The Journal of Supercomputing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The K1,2-structure-connectivity of graphs\",\"authors\":\"Xiao Zhao, Haojie Zheng, Hengzhe Li\",\"doi\":\"10.1007/s11227-024-06390-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we focus on examining the <span>\\\\(K_{1,2}\\\\)</span>-structure-connectivity of any connected graph. Let <i>G</i> be a connected graph with <i>n</i> vertices, we show that <span>\\\\(\\\\kappa (G; K_{1,2})\\\\)</span> is well defined if <span>\\\\(\\\\hbox {diam}(G)\\\\ge 4\\\\)</span>, or <span>\\\\(n\\\\equiv 1\\\\pmod 3\\\\)</span>, or <span>\\\\(G\\\\notin \\\\{C_{5},K_{n}\\\\}\\\\)</span> when <span>\\\\(n\\\\equiv 2\\\\pmod 3\\\\)</span>, or there exist three vertices <i>u</i>, <i>v</i>, <i>w</i> such that <span>\\\\(N_{G}(u)\\\\cap (N_{G}(\\\\{v,w\\\\})\\\\cup \\\\{v,w\\\\})=\\\\emptyset\\\\)</span> when <span>\\\\(n\\\\equiv 0\\\\pmod 3\\\\)</span>. Furthermore, if <i>G</i> has <span>\\\\(K_{1,2}\\\\)</span>-structure-cut, we prove <span>\\\\(\\\\kappa (G)/3\\\\le \\\\kappa (G; K_{1,2})\\\\le \\\\kappa (G)\\\\)</span>.</p>\",\"PeriodicalId\":501596,\"journal\":{\"name\":\"The Journal of Supercomputing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Journal of Supercomputing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11227-024-06390-5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Journal of Supercomputing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11227-024-06390-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们将重点研究任意连通图的\(K_{1,2}\)-结构-连通性。让 G 是一个有 n 个顶点的连通图,我们证明,如果 \kappa (G. K_{1,2}\) 定义良好,那么 \kappa (G. K_{1,2}\) 就是连通图;如果(\hbox {diam}(G)\ge 4\), 或者(n\equiv 1\pmod 3\), 或者(G\notin \{C_{5},K_{n}\}) 当(n\equiv 2\pmod 3\)、或者存在三个顶点u, v, w,当(n/equiv 0\pmod 3\) 时,\(N_{G}(u)\cap (N_{G}(\{v,w\})\cup \{v,w\})=\emptyset\).此外,如果G有\(K_{1,2}\)-结构切分,我们证明\(\kappa (G)/3\le \kappa (G; K_{1,2})\le \kappa (G)\).
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The K1,2-structure-connectivity of graphs

In this paper, we focus on examining the \(K_{1,2}\)-structure-connectivity of any connected graph. Let G be a connected graph with n vertices, we show that \(\kappa (G; K_{1,2})\) is well defined if \(\hbox {diam}(G)\ge 4\), or \(n\equiv 1\pmod 3\), or \(G\notin \{C_{5},K_{n}\}\) when \(n\equiv 2\pmod 3\), or there exist three vertices uvw such that \(N_{G}(u)\cap (N_{G}(\{v,w\})\cup \{v,w\})=\emptyset\) when \(n\equiv 0\pmod 3\). Furthermore, if G has \(K_{1,2}\)-structure-cut, we prove \(\kappa (G)/3\le \kappa (G; K_{1,2})\le \kappa (G)\).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A quadratic regression model to quantify certain latest corona treatment drug molecules based on coindices of M-polynomial Data integration from traditional to big data: main features and comparisons of ETL approaches End-to-end probability analysis method for multi-core distributed systems A cloud computing approach to superscale colored traveling salesman problems Approximating neural distinguishers using differential-linear imbalance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1