某些Kneser图的顶点应力相关参数

IF 0.3 Q4 COMPUTER SCIENCE, THEORY & METHODS Acta Universitatis Sapientiae Informatica Pub Date : 2021-12-01 DOI:10.2478/ausi-2021-0015
J. Kok
{"title":"某些Kneser图的顶点应力相关参数","authors":"J. Kok","doi":"10.2478/ausi-2021-0015","DOIUrl":null,"url":null,"abstract":"Abstract This paper presents results for some vertex stress related parameters in respect of specific subfamilies of Kneser graphs. Kneser graphs for which diam(KG(n, k)) = 2 and k ≥ 2 are considered. The note establishes the foundation for researching similar results for Kneser graphs for which diam(KG(n, k)) ≥ 3. In addition some important vertex stress related properties are stated. Finally some results for specific bipartite Kneser graphs i.e. BK(n, 1), n ≥ 3 will be presented. In the conclusion some worthy research avenues are proposed.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"56 2","pages":"324 - 334"},"PeriodicalIF":0.3000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Vertex stress related parameters for certain Kneser graphs\",\"authors\":\"J. Kok\",\"doi\":\"10.2478/ausi-2021-0015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract This paper presents results for some vertex stress related parameters in respect of specific subfamilies of Kneser graphs. Kneser graphs for which diam(KG(n, k)) = 2 and k ≥ 2 are considered. The note establishes the foundation for researching similar results for Kneser graphs for which diam(KG(n, k)) ≥ 3. In addition some important vertex stress related properties are stated. Finally some results for specific bipartite Kneser graphs i.e. BK(n, 1), n ≥ 3 will be presented. In the conclusion some worthy research avenues are proposed.\",\"PeriodicalId\":41480,\"journal\":{\"name\":\"Acta Universitatis Sapientiae Informatica\",\"volume\":\"56 2\",\"pages\":\"324 - 334\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Universitatis Sapientiae Informatica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/ausi-2021-0015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Universitatis Sapientiae Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ausi-2021-0015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1

摘要

摘要本文给出了关于Kneser图的特定子族的一些顶点应力相关参数的结果。考虑直径(KG(n, k)) = 2且k≥2的Kneser图。这为研究直径(KG(n, k))≥3的Kneser图的类似结果奠定了基础。此外,还说明了一些重要的与顶点应力有关的性质。最后给出了特定二部Kneser图(BK(n, 1), n≥3)的一些结果。在结论部分,提出了一些有价值的研究方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Vertex stress related parameters for certain Kneser graphs
Abstract This paper presents results for some vertex stress related parameters in respect of specific subfamilies of Kneser graphs. Kneser graphs for which diam(KG(n, k)) = 2 and k ≥ 2 are considered. The note establishes the foundation for researching similar results for Kneser graphs for which diam(KG(n, k)) ≥ 3. In addition some important vertex stress related properties are stated. Finally some results for specific bipartite Kneser graphs i.e. BK(n, 1), n ≥ 3 will be presented. In the conclusion some worthy research avenues are proposed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Acta Universitatis Sapientiae Informatica
Acta Universitatis Sapientiae Informatica COMPUTER SCIENCE, THEORY & METHODS-
自引率
0.00%
发文量
9
期刊最新文献
E-super arithmetic graceful labelling of Hi(m, m), Hi(1) (m, m) and chain of even cycles On agglomeration-based rupture degree in networks and a heuristic algorithm On domination in signed graphs Connected certified domination edge critical and stable graphs Eccentric connectivity index in transformation graph Gxy+
×
引用
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