R. Katare, T. A. Shiekh, Fayaz Naikoo, Gh. Hassan Ganaie
{"title":"完全图与完全差分网络(PDN)的综合研究","authors":"R. Katare, T. A. Shiekh, Fayaz Naikoo, Gh. Hassan Ganaie","doi":"10.1109/INTELLISYS.2017.8324341","DOIUrl":null,"url":null,"abstract":"In this paper, we have explored the graph properties of PDN and Complete Graph of (δ<sup>2</sup>+ δ+l) node networks to make the complete traversal of the perfect different network (PDN). We have also showed the diagonal links of PDN through its adjacency matrix. In this paper, we have also calculated the density for Hypercube, PDN, and Complete Graph architectures by manipulating the edges of these architectures. The symmetry in Complete Graph of (δ<sup>2</sup>+ δ+1) nodes is seen on the repetition of edges in different circuits. In this paper, we have also seen that on the removal of chordal ring links in Complete Graph the circuits removed are getting successively decreased.","PeriodicalId":131825,"journal":{"name":"2017 Intelligent Systems Conference (IntelliSys)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Comprehensive study of complete graph and Perfect Difference Network (PDN)\",\"authors\":\"R. Katare, T. A. Shiekh, Fayaz Naikoo, Gh. Hassan Ganaie\",\"doi\":\"10.1109/INTELLISYS.2017.8324341\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we have explored the graph properties of PDN and Complete Graph of (δ<sup>2</sup>+ δ+l) node networks to make the complete traversal of the perfect different network (PDN). We have also showed the diagonal links of PDN through its adjacency matrix. In this paper, we have also calculated the density for Hypercube, PDN, and Complete Graph architectures by manipulating the edges of these architectures. The symmetry in Complete Graph of (δ<sup>2</sup>+ δ+1) nodes is seen on the repetition of edges in different circuits. In this paper, we have also seen that on the removal of chordal ring links in Complete Graph the circuits removed are getting successively decreased.\",\"PeriodicalId\":131825,\"journal\":{\"name\":\"2017 Intelligent Systems Conference (IntelliSys)\",\"volume\":\"104 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Intelligent Systems Conference (IntelliSys)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INTELLISYS.2017.8324341\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Intelligent Systems Conference (IntelliSys)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTELLISYS.2017.8324341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comprehensive study of complete graph and Perfect Difference Network (PDN)
In this paper, we have explored the graph properties of PDN and Complete Graph of (δ2+ δ+l) node networks to make the complete traversal of the perfect different network (PDN). We have also showed the diagonal links of PDN through its adjacency matrix. In this paper, we have also calculated the density for Hypercube, PDN, and Complete Graph architectures by manipulating the edges of these architectures. The symmetry in Complete Graph of (δ2+ δ+1) nodes is seen on the repetition of edges in different circuits. In this paper, we have also seen that on the removal of chordal ring links in Complete Graph the circuits removed are getting successively decreased.