{"title":"两个平面图组成的维纳指数","authors":"Mohamed Essalih","doi":"10.1109/PICICT.2013.15","DOIUrl":null,"url":null,"abstract":"The Wiener index, is the first, and also one of the most important topological indices of chemical graphs. Furthermore, there are many situations in communication, facility location, cryptology, architecture etc, where the Wiener index of the corresponding graph or the average distance is of great interest. One of the problems, for example, is to find a spanning tree with minimum average distance. In this paper we present the notion of the composition of two planar graphs, through some examples and, we will focus to calculate the Wiener index for the composition of two cycle planar graphs W(Cn1 °Cn2 ) and the Wiener index for the composition of cycle planar graph and path planar graph W(Cn1°Pn2 ), using oar's theorem.","PeriodicalId":320407,"journal":{"name":"2013 Palestinian International Conference on Information and Communication Technology","volume":"1995 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Wiener Index of the Composition of Two Planar Graphs\",\"authors\":\"Mohamed Essalih\",\"doi\":\"10.1109/PICICT.2013.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Wiener index, is the first, and also one of the most important topological indices of chemical graphs. Furthermore, there are many situations in communication, facility location, cryptology, architecture etc, where the Wiener index of the corresponding graph or the average distance is of great interest. One of the problems, for example, is to find a spanning tree with minimum average distance. In this paper we present the notion of the composition of two planar graphs, through some examples and, we will focus to calculate the Wiener index for the composition of two cycle planar graphs W(Cn1 °Cn2 ) and the Wiener index for the composition of cycle planar graph and path planar graph W(Cn1°Pn2 ), using oar's theorem.\",\"PeriodicalId\":320407,\"journal\":{\"name\":\"2013 Palestinian International Conference on Information and Communication Technology\",\"volume\":\"1995 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Palestinian International Conference on Information and Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PICICT.2013.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Palestinian International Conference on Information and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PICICT.2013.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Wiener Index of the Composition of Two Planar Graphs
The Wiener index, is the first, and also one of the most important topological indices of chemical graphs. Furthermore, there are many situations in communication, facility location, cryptology, architecture etc, where the Wiener index of the corresponding graph or the average distance is of great interest. One of the problems, for example, is to find a spanning tree with minimum average distance. In this paper we present the notion of the composition of two planar graphs, through some examples and, we will focus to calculate the Wiener index for the composition of two cycle planar graphs W(Cn1 °Cn2 ) and the Wiener index for the composition of cycle planar graph and path planar graph W(Cn1°Pn2 ), using oar's theorem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
