无穷类l -边能图的无穷个数

IF 2.9 2区化学 Q2 CHEMISTRY, MULTIDISCIPLINARY

Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2023-07-01 DOI:10.46793/match.90-3.729l

Qiuping Li, Liangwen Tang

{"title":"无穷类l -边能图的无穷个数","authors":"Qiuping Li, Liangwen Tang","doi":"10.46793/match.90-3.729l","DOIUrl":null,"url":null,"abstract":"The graph G of order n is an L-borderenergetic graph which means it has the same Laplacian energy as the complete graph Kn. In this paper, we find that the combination of complete bipartite graphs and stars can construct infinite numbers of infinite classes L-borderenergetic graphs. We give two infinite numbers of infinite classes L-borderenergetic graphs and two infinite classes Lborderenergetic graphs under the operators union, join and their mixed. This research could provide experience for further study the structural characteristics of L-borderenergetic graphs.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":"47 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Infinite Numbers of Infinite Classes L-Borderenergetic Graphs\",\"authors\":\"Qiuping Li, Liangwen Tang\",\"doi\":\"10.46793/match.90-3.729l\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The graph G of order n is an L-borderenergetic graph which means it has the same Laplacian energy as the complete graph Kn. In this paper, we find that the combination of complete bipartite graphs and stars can construct infinite numbers of infinite classes L-borderenergetic graphs. We give two infinite numbers of infinite classes L-borderenergetic graphs and two infinite classes Lborderenergetic graphs under the operators union, join and their mixed. This research could provide experience for further study the structural characteristics of L-borderenergetic graphs.\",\"PeriodicalId\":51115,\"journal\":{\"name\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"volume\":\"47 1\",\"pages\":\"\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2023-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Match-Communications in Mathematical and in Computer Chemistry\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://doi.org/10.46793/match.90-3.729l\",\"RegionNum\":2,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.46793/match.90-3.729l","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

n阶图G是一个l边能图这意味着它和完整图Kn有相同的拉普拉斯能量。本文研究了完全二部图与星形图的组合可以构造无限个无限类的l -边能图。给出了两个无限数量的无限类l -边能图和两个无限类l -边能图在算子联合、连接及其混合下的性质。本研究为进一步研究l -边能图的结构特征提供了经验。

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

查看原文本刊更多论文

Infinite Numbers of Infinite Classes L-Borderenergetic Graphs

The graph G of order n is an L-borderenergetic graph which means it has the same Laplacian energy as the complete graph Kn. In this paper, we find that the combination of complete bipartite graphs and stars can construct infinite numbers of infinite classes L-borderenergetic graphs. We give two infinite numbers of infinite classes L-borderenergetic graphs and two infinite classes Lborderenergetic graphs under the operators union, join and their mixed. This research could provide experience for further study the structural characteristics of L-borderenergetic graphs.

求助全文

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

来源期刊

Match-Communications in Mathematical and in Computer Chemistry 化学-化学综合

CiteScore

4.40

自引率

26.90%

发文量

审稿时长

2 months

期刊介绍： MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.