Xiaomin Zhu, Lihua Feng, Minmin Liu, Weijun Liu, Yuqin Hu
{"title":"一些拓扑指标和图的性质","authors":"Xiaomin Zhu, Lihua Feng, Minmin Liu, Weijun Liu, Yuqin Hu","doi":"10.22108/TOC.2017.21467","DOIUrl":null,"url":null,"abstract":"In this paper, by using the degree sequences of graphs, we present sufficient conditions for a graph to be Hamiltonian, traceable, Hamilton-connected or $k$-connected in light of numerous topological indices such as the eccentric connectivity index, the eccentric distance sum, the connective eccentricity index.","PeriodicalId":43837,"journal":{"name":"Transactions on Combinatorics","volume":"6 1","pages":"51-65"},"PeriodicalIF":0.6000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Some topological indices and graph properties\",\"authors\":\"Xiaomin Zhu, Lihua Feng, Minmin Liu, Weijun Liu, Yuqin Hu\",\"doi\":\"10.22108/TOC.2017.21467\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, by using the degree sequences of graphs, we present sufficient conditions for a graph to be Hamiltonian, traceable, Hamilton-connected or $k$-connected in light of numerous topological indices such as the eccentric connectivity index, the eccentric distance sum, the connective eccentricity index.\",\"PeriodicalId\":43837,\"journal\":{\"name\":\"Transactions on Combinatorics\",\"volume\":\"6 1\",\"pages\":\"51-65\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2017.21467\",\"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.2017.21467","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
In this paper, by using the degree sequences of graphs, we present sufficient conditions for a graph to be Hamiltonian, traceable, Hamilton-connected or $k$-connected in light of numerous topological indices such as the eccentric connectivity index, the eccentric distance sum, the connective eccentricity index.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
