{"title":"The Geodetic Number of Cm × Cn","authors":"Jianxiang Cao, Bin Wu, Minyong Shi","doi":"10.1109/ICMSS.2009.5304507","DOIUrl":null,"url":null,"abstract":"Graph theory is the theoretical fundamental of network technologies. This paper reports an investigation of stability issues of the network technologies based on the graph theory. It also presents solutions of the geodetic number of graph Cm × Cn. There are many parameters which can measure to some extent the robustness of an interconnection network with respect to link failures, such as domination number and bondage number. Another parameter, the geodetic number, has been studied widely in the recent literature. Determining the geodetic number of an arbitrary graph however can be proved to be NP-hard. Therefore it is natural to investigate some specific cases for the geodetic number of special graphs. The solving process of one of such cases is presented. Index Terms—geodesic, geodetic set, geodetic number, con- nected geodetic set, connected geodetic number, open geodetic set, open geodetic number.","PeriodicalId":267621,"journal":{"name":"2009 International Conference on Management and Service Science","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Management and Service Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMSS.2009.5304507","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Graph theory is the theoretical fundamental of network technologies. This paper reports an investigation of stability issues of the network technologies based on the graph theory. It also presents solutions of the geodetic number of graph Cm × Cn. There are many parameters which can measure to some extent the robustness of an interconnection network with respect to link failures, such as domination number and bondage number. Another parameter, the geodetic number, has been studied widely in the recent literature. Determining the geodetic number of an arbitrary graph however can be proved to be NP-hard. Therefore it is natural to investigate some specific cases for the geodetic number of special graphs. The solving process of one of such cases is presented. Index Terms—geodesic, geodetic set, geodetic number, con- nected geodetic set, connected geodetic number, open geodetic set, open geodetic number.