{"title":"两个图乘积的度距离和Gutman指数","authors":"S. Sedghi, N. Shobe","doi":"10.13069/jacodesmath.729422","DOIUrl":null,"url":null,"abstract":"The degree distance was introduced by Dobrynin, Kochetova and Gutman as a weighted version of the Wiener index. In this paper, we investigate the degree distance and Gutman index of complete, and strong product graphs by using the adjacency and distance matrices of a graph.","PeriodicalId":37029,"journal":{"name":"Journal of Algebra Combinatorics Discrete Structures and Applications","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Degree distance and Gutman index of two graph products\",\"authors\":\"S. Sedghi, N. Shobe\",\"doi\":\"10.13069/jacodesmath.729422\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The degree distance was introduced by Dobrynin, Kochetova and Gutman as a weighted version of the Wiener index. In this paper, we investigate the degree distance and Gutman index of complete, and strong product graphs by using the adjacency and distance matrices of a graph.\",\"PeriodicalId\":37029,\"journal\":{\"name\":\"Journal of Algebra Combinatorics Discrete Structures and Applications\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Algebra Combinatorics Discrete Structures and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.13069/jacodesmath.729422\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebra Combinatorics Discrete Structures and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13069/jacodesmath.729422","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
Degree distance and Gutman index of two graph products
The degree distance was introduced by Dobrynin, Kochetova and Gutman as a weighted version of the Wiener index. In this paper, we investigate the degree distance and Gutman index of complete, and strong product graphs by using the adjacency and distance matrices of a graph.