图的子集-强积

IF 0.4 Q4 MATHEMATICS

Annales Mathematicae Silesianae Pub Date : 2024-01-10 DOI:10.2478/amsil-2023-0029

Mehdi Eliasi

{"title":"图的子集-强积","authors":"Mehdi Eliasi","doi":"10.2478/amsil-2023-0029","DOIUrl":null,"url":null,"abstract":"Abstract In this paper, we introduce the subset-strong product of graphs and give a method for calculating the adjacency spectrum of this product. In addition, exact expressions for the first and second Zagreb indices of the subset-strong products of two graphs are reported. Examples are provided to illustrate the applications of this product in some growing graphs and complex networks.","PeriodicalId":52359,"journal":{"name":"Annales Mathematicae Silesianae","volume":"54 8","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Subset-Strong Product of Graphs\",\"authors\":\"Mehdi Eliasi\",\"doi\":\"10.2478/amsil-2023-0029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this paper, we introduce the subset-strong product of graphs and give a method for calculating the adjacency spectrum of this product. In addition, exact expressions for the first and second Zagreb indices of the subset-strong products of two graphs are reported. Examples are provided to illustrate the applications of this product in some growing graphs and complex networks.\",\"PeriodicalId\":52359,\"journal\":{\"name\":\"Annales Mathematicae Silesianae\",\"volume\":\"54 8\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2024-01-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annales Mathematicae Silesianae\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/amsil-2023-0029\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annales Mathematicae Silesianae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/amsil-2023-0029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

摘要本文介绍了图的子集-强积，并给出了计算该积邻接谱的方法。此外，还报告了两个图的子集-强积的第一和第二萨格勒布指数的精确表达式。还提供了一些示例来说明该积在一些生长图和复杂网络中的应用。

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

查看原文本刊更多论文

The Subset-Strong Product of Graphs

Abstract In this paper, we introduce the subset-strong product of graphs and give a method for calculating the adjacency spectrum of this product. In addition, exact expressions for the first and second Zagreb indices of the subset-strong products of two graphs are reported. Examples are provided to illustrate the applications of this product in some growing graphs and complex networks.

求助全文

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

来源期刊

Annales Mathematicae Silesianae Mathematics-Mathematics (all)

CiteScore

0.60

自引率

25.00%

发文量

审稿时长

27 weeks