3-Path Decompositions of the Line Graph of the Complete Bipartite Graph

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2024-01-24 DOI:10.1142/s0219265923500378
Limin Gao, Weihua Yang
{"title":"3-Path Decompositions of the Line Graph of the Complete Bipartite Graph","authors":"Limin Gao, Weihua Yang","doi":"10.1142/s0219265923500378","DOIUrl":null,"url":null,"abstract":"The line graph is a very popular research object in graph theory, in complex networks and also in social networks recently. Let [Formula: see text] be the line graph of the complete bipartite graph [Formula: see text] and [Formula: see text] be a path of length [Formula: see text]. In this paper, we give necessary and sufficient conditions for the existence of [Formula: see text]-decompositions of [Formula: see text].","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF INTERCONNECTION NETWORKS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265923500378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

The line graph is a very popular research object in graph theory, in complex networks and also in social networks recently. Let [Formula: see text] be the line graph of the complete bipartite graph [Formula: see text] and [Formula: see text] be a path of length [Formula: see text]. In this paper, we give necessary and sufficient conditions for the existence of [Formula: see text]-decompositions of [Formula: see text].
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
完整二方图线图的 3 路径分解
线图是最近图论、复杂网络和社交网络中非常热门的研究对象。设[式:见正文]是完整二方图[式:见正文]的线图,[式:见正文]是长度为[式:见正文]的路径。本文给出了[式:见文本]的[式:见文本]分解存在的必要条件和充分条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
JOURNAL OF INTERCONNECTION NETWORKS
JOURNAL OF INTERCONNECTION NETWORKS COMPUTER SCIENCE, THEORY & METHODS-
自引率
14.30%
发文量
121
期刊介绍: The Journal of Interconnection Networks (JOIN) is an international scientific journal dedicated to advancing the state-of-the-art of interconnection networks. The journal addresses all aspects of interconnection networks including their theory, analysis, design, implementation and application, and corresponding issues of communication, computing and function arising from (or applied to) a variety of multifaceted networks. Interconnection problems occur at different levels in the hardware and software design of communicating entities in integrated circuits, multiprocessors, multicomputers, and communication networks as diverse as telephone systems, cable network systems, computer networks, mobile communication networks, satellite network systems, the Internet and biological systems.
期刊最新文献
On Sombor Index of Unicyclic and Bicyclic Graphs Monitoring Edge-Geodetic Numbers of Mycielskian Graph Classes Minimum Congestion and Wirelength of Embedding the nth Cartesian Product of K4 into Various Kinds of Grid Networks The Graft Transformation and Their Application on the Spectral Radius of Block Graphs Graph Bipartization and Via Minimization for Intersection Graphs
×
引用
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