完备图与完全差分网络的格表示

2018 International Conference on Circuits and Systems in Digital Enterprise Technology (ICCSDET) Pub Date : 2018-12-01 DOI:10.1109/ICCSDET.2018.8821111

T. A. Shiekh, Jitendra Seethalani

{"title":"完备图与完全差分网络的格表示","authors":"T. A. Shiekh, Jitendra Seethalani","doi":"10.1109/ICCSDET.2018.8821111","DOIUrl":null,"url":null,"abstract":"In this paper we have evaluated the links of Complete Graph and Perfect Difference Network (PDN) of (δ2 + δ+1) nodes in order to derive a relation which gives us the total number of disjoint lattices formed in a Complete Graph and Perfect Difference Network (PDN) of (δ2 + δ +1) nodes. In this paper we have also seen that the smallest lattice formed in a Complete Graph and PDN of (δ2+δ+1) includes only three nodes and the biggest lattice formed in a Complete Graph and PDN includes all the nodes of the Complete Graph and PDN i.e. (δ2 + δ+1) nodes. In this paper we have also seen the effect of removal of diagonal links in the Perfect Difference Network in lattice formation.","PeriodicalId":157362,"journal":{"name":"2018 International Conference on Circuits and Systems in Digital Enterprise Technology (ICCSDET)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lattice representation of Complete Graph and Perfect Difference Network (PDN)\",\"authors\":\"T. A. Shiekh, Jitendra Seethalani\",\"doi\":\"10.1109/ICCSDET.2018.8821111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we have evaluated the links of Complete Graph and Perfect Difference Network (PDN) of (δ2 + δ+1) nodes in order to derive a relation which gives us the total number of disjoint lattices formed in a Complete Graph and Perfect Difference Network (PDN) of (δ2 + δ +1) nodes. In this paper we have also seen that the smallest lattice formed in a Complete Graph and PDN of (δ2+δ+1) includes only three nodes and the biggest lattice formed in a Complete Graph and PDN includes all the nodes of the Complete Graph and PDN i.e. (δ2 + δ+1) nodes. In this paper we have also seen the effect of removal of diagonal links in the Perfect Difference Network in lattice formation.\",\"PeriodicalId\":157362,\"journal\":{\"name\":\"2018 International Conference on Circuits and Systems in Digital Enterprise Technology (ICCSDET)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Circuits and Systems in Digital Enterprise Technology (ICCSDET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSDET.2018.8821111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Circuits and Systems in Digital Enterprise Technology (ICCSDET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSDET.2018.8821111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文对(δ2 + δ+1)节点的完全图和完全差分网络(PDN)的链接进行了评价，从而导出了(δ2 + δ+1)节点的完全图和完全差分网络(PDN)中不相交格的总数的关系式。在本文中我们还看到，在完全图和PDN (δ2+δ+1)中形成的最小格只包含三个节点，在完全图和PDN (δ2+δ+1)中形成的最大格包括完全图和PDN的所有节点，即(δ2+δ+1)节点。在本文中，我们还看到了在晶格形成的完全差分网络中去除对角连接的效果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Lattice representation of Complete Graph and Perfect Difference Network (PDN)

In this paper we have evaluated the links of Complete Graph and Perfect Difference Network (PDN) of (δ2 + δ+1) nodes in order to derive a relation which gives us the total number of disjoint lattices formed in a Complete Graph and Perfect Difference Network (PDN) of (δ2 + δ +1) nodes. In this paper we have also seen that the smallest lattice formed in a Complete Graph and PDN of (δ2+δ+1) includes only three nodes and the biggest lattice formed in a Complete Graph and PDN includes all the nodes of the Complete Graph and PDN i.e. (δ2 + δ+1) nodes. In this paper we have also seen the effect of removal of diagonal links in the Perfect Difference Network in lattice formation.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 International Conference on Circuits and Systems in Digital Enterprise Technology (ICCSDET)

自引率

0.00%

发文量