给定参数下树的度阻力距离

IF 0.6 Q3 MATHEMATICS

Transactions on Combinatorics Pub Date : 2018-12-01 DOI:10.22108/TOC.2018.108656.1538

Fangguo He, Xinnong Jiang

{"title":"给定参数下树的度阻力距离","authors":"Fangguo He, Xinnong Jiang","doi":"10.22108/TOC.2018.108656.1538","DOIUrl":null,"url":null,"abstract":"The degree resistance distance of a graph $G$ is defined as $D_R(G)=sum_{i<j}(d(v_i)+d(v_j))R(v_i,v_j)$, where $d(v_i)$ is the degree of the vertex $v_i$, and $R(v_i,v_j)$ is the resistance distance between the vertices $v_i$ and $v_j$. Here we characterize the extremal graphs with respect to degree resistance distance among trees with given diameter, number of pendent vertices, independence number, covering number, and maximum degree, respectively.","PeriodicalId":43837,"journal":{"name":"Transactions on Combinatorics","volume":"7 1","pages":"11-24"},"PeriodicalIF":0.6000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Degree resistance distance of trees with some given parameters\",\"authors\":\"Fangguo He, Xinnong Jiang\",\"doi\":\"10.22108/TOC.2018.108656.1538\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The degree resistance distance of a graph $G$ is defined as $D_R(G)=sum_{i<j}(d(v_i)+d(v_j))R(v_i,v_j)$, where $d(v_i)$ is the degree of the vertex $v_i$, and $R(v_i,v_j)$ is the resistance distance between the vertices $v_i$ and $v_j$. Here we characterize the extremal graphs with respect to degree resistance distance among trees with given diameter, number of pendent vertices, independence number, covering number, and maximum degree, respectively.\",\"PeriodicalId\":43837,\"journal\":{\"name\":\"Transactions on Combinatorics\",\"volume\":\"7 1\",\"pages\":\"11-24\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2018.108656.1538\",\"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":"Transactions on Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/TOC.2018.108656.1538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}