{"title":"关于特殊网络可移动边的说明","authors":"Jianxiang Cao, Minyong Shi","doi":"10.1109/CSO.2011.219","DOIUrl":null,"url":null,"abstract":"It is well-known that the topological structure of an interconnection network can be modeled by a connected graph, whose vertices represent sites of the network and whose edges represent physical communication links. Such a close interrelation between graph theory and network motivates us to investigate the stability of graphs with respect to edge or vertex alteration. Since Tutte gave an instruction of 3-connected graphs in 1961--research on structural characterization of connected graph becomes a very popular topic in graph theory. It plays an important role in both theoretical respect and practical applications due to its close connection to network modeling and combinatorial optimization. The concepts of removable edges and contractible edges of graphs are powerful tools to study the structure of graphs and to prove properties of graphs by induction. In this paper we mainly consider the number of removable edges in 3-regular 3-connected graphs whose girth keeps at least 4.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Remarks on the Removable Edges of a Spectial Network\",\"authors\":\"Jianxiang Cao, Minyong Shi\",\"doi\":\"10.1109/CSO.2011.219\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is well-known that the topological structure of an interconnection network can be modeled by a connected graph, whose vertices represent sites of the network and whose edges represent physical communication links. Such a close interrelation between graph theory and network motivates us to investigate the stability of graphs with respect to edge or vertex alteration. Since Tutte gave an instruction of 3-connected graphs in 1961--research on structural characterization of connected graph becomes a very popular topic in graph theory. It plays an important role in both theoretical respect and practical applications due to its close connection to network modeling and combinatorial optimization. The concepts of removable edges and contractible edges of graphs are powerful tools to study the structure of graphs and to prove properties of graphs by induction. In this paper we mainly consider the number of removable edges in 3-regular 3-connected graphs whose girth keeps at least 4.\",\"PeriodicalId\":210815,\"journal\":{\"name\":\"2011 Fourth International Joint Conference on Computational Sciences and Optimization\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Fourth International Joint Conference on Computational Sciences and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2011.219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2011.219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Remarks on the Removable Edges of a Spectial Network
It is well-known that the topological structure of an interconnection network can be modeled by a connected graph, whose vertices represent sites of the network and whose edges represent physical communication links. Such a close interrelation between graph theory and network motivates us to investigate the stability of graphs with respect to edge or vertex alteration. Since Tutte gave an instruction of 3-connected graphs in 1961--research on structural characterization of connected graph becomes a very popular topic in graph theory. It plays an important role in both theoretical respect and practical applications due to its close connection to network modeling and combinatorial optimization. The concepts of removable edges and contractible edges of graphs are powerful tools to study the structure of graphs and to prove properties of graphs by induction. In this paper we mainly consider the number of removable edges in 3-regular 3-connected graphs whose girth keeps at least 4.