完整二方图线图的 3 路径分解

Pub Date : 2024-01-24 DOI:10.1142/s0219265923500378

Limin Gao, Weihua Yang

{"title":"完整二方图线图的 3 路径分解","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":0,"journal":{"name":"","volume":"5 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":0,\"journal\":{\"name\":\"\",\"volume\":\"5 2\",\"pages\":\"\"},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219265923500378\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265923500378","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

线图是最近图论、复杂网络和社交网络中非常热门的研究对象。设[式：见正文]是完整二方图[式：见正文]的线图，[式：见正文]是长度为[式：见正文]的路径。本文给出了[式：见文本]的[式：见文本]分解存在的必要条件和充分条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

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

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

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].

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助