{"title":"图运算的修改的第二次乘法萨格勒布指数的上界","authors":"B. Basavanagoud, Shreekant Patil","doi":"10.18052/WWW.SCIPRESS.COM/BMSA.17.10","DOIUrl":null,"url":null,"abstract":"The modified second multiplicative Zagreb index of a connected graph G, denoted by ∏ 2 (G), is defined as ∏ ∗ 2 (G) = ∏ uv∈E(G) [dG(u) + dG(v)] [dG(u)+dG(v)] where dG(z) is the degree of a vertex z in G . In this paper, we present some upper bounds for the modified second multiplicative Zagreb index of graph operations such as union, join, Cartesian product, composition and corona product of graphs are derived.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Upper Bounds for the Modified Second Multiplicative Zagreb Index of Graph Operations\",\"authors\":\"B. Basavanagoud, Shreekant Patil\",\"doi\":\"10.18052/WWW.SCIPRESS.COM/BMSA.17.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The modified second multiplicative Zagreb index of a connected graph G, denoted by ∏ 2 (G), is defined as ∏ ∗ 2 (G) = ∏ uv∈E(G) [dG(u) + dG(v)] [dG(u)+dG(v)] where dG(z) is the degree of a vertex z in G . In this paper, we present some upper bounds for the modified second multiplicative Zagreb index of graph operations such as union, join, Cartesian product, composition and corona product of graphs are derived.\",\"PeriodicalId\":252632,\"journal\":{\"name\":\"Bulletin of Mathematical Sciences and Applications\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of Mathematical Sciences and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.17.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Mathematical Sciences and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BMSA.17.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Upper Bounds for the Modified Second Multiplicative Zagreb Index of Graph Operations
The modified second multiplicative Zagreb index of a connected graph G, denoted by ∏ 2 (G), is defined as ∏ ∗ 2 (G) = ∏ uv∈E(G) [dG(u) + dG(v)] [dG(u)+dG(v)] where dG(z) is the degree of a vertex z in G . In this paper, we present some upper bounds for the modified second multiplicative Zagreb index of graph operations such as union, join, Cartesian product, composition and corona product of graphs are derived.