{"title":"Research on the neural networks and the geodetic number of the graph","authors":"Jianxiang Cao, Bin Wu, Minyong Shi","doi":"10.1109/COGINF.2009.5250702","DOIUrl":null,"url":null,"abstract":"Graph theory is the fundamental basis of the neural networks. This paper reports the investigation work of the relationships between artificial neural networks and graph theory, and presents the analysis of the specific issues relating to the change of the geodetic number due to operations on the graphs. Recent research work on the geodetic number of graphs has been found in the literature. Determining the geodetic number of arbitrary graph can be proved to be NP-hard. However, a fundamental issue in graph theory concerns how a parameter value is affected after small changes executed to the graph. This issue is analyzed in the authors' research by adding or contracting an edge to the graph.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 8th IEEE International Conference on Cognitive Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COGINF.2009.5250702","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Graph theory is the fundamental basis of the neural networks. This paper reports the investigation work of the relationships between artificial neural networks and graph theory, and presents the analysis of the specific issues relating to the change of the geodetic number due to operations on the graphs. Recent research work on the geodetic number of graphs has been found in the literature. Determining the geodetic number of arbitrary graph can be proved to be NP-hard. However, a fundamental issue in graph theory concerns how a parameter value is affected after small changes executed to the graph. This issue is analyzed in the authors' research by adding or contracting an edge to the graph.