{"title":"关于距离平衡图的新推广","authors":"M. Faghani, E. Pourhadi, H. Kharazi","doi":"10.22108/TOC.2016.15048","DOIUrl":null,"url":null,"abstract":"In this paper, we initially introduce the concept of $n$-distance-balanced property which is considered as the generalized concept of distance-balanced property. In our consideration, we also define the new concept locally regularity in order to find a connection between $n$-distance-balanced graphs and their lexicographic product. Furthermore, we include a characteristic method which is practicable and can be used to classify all graphs with $i$-distance-balanced properties for $ i=2,3 $ which is also relevant to the concept of total distance. Moreover, we conclude a connection between distance-balanced and 2-distance-balanced graphs.","PeriodicalId":43837,"journal":{"name":"Transactions on Combinatorics","volume":"5 1","pages":"21-34"},"PeriodicalIF":0.6000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"ON THE NEW EXTENSION OF DISTANCE-BALANCED GRAPHS\",\"authors\":\"M. Faghani, E. Pourhadi, H. Kharazi\",\"doi\":\"10.22108/TOC.2016.15048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we initially introduce the concept of $n$-distance-balanced property which is considered as the generalized concept of distance-balanced property. In our consideration, we also define the new concept locally regularity in order to find a connection between $n$-distance-balanced graphs and their lexicographic product. Furthermore, we include a characteristic method which is practicable and can be used to classify all graphs with $i$-distance-balanced properties for $ i=2,3 $ which is also relevant to the concept of total distance. Moreover, we conclude a connection between distance-balanced and 2-distance-balanced graphs.\",\"PeriodicalId\":43837,\"journal\":{\"name\":\"Transactions on Combinatorics\",\"volume\":\"5 1\",\"pages\":\"21-34\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2016.15048\",\"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.2016.15048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
In this paper, we initially introduce the concept of $n$-distance-balanced property which is considered as the generalized concept of distance-balanced property. In our consideration, we also define the new concept locally regularity in order to find a connection between $n$-distance-balanced graphs and their lexicographic product. Furthermore, we include a characteristic method which is practicable and can be used to classify all graphs with $i$-distance-balanced properties for $ i=2,3 $ which is also relevant to the concept of total distance. Moreover, we conclude a connection between distance-balanced and 2-distance-balanced graphs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
