面向关联矩阵的图演化

2022 11th International Conference on Modern Circuits and Systems Technologies (MOCAST) Pub Date : 2022-06-08 DOI:10.1109/mocast54814.2022.9837590

Cristian E. Onete, M. Onete

{"title":"面向关联矩阵的图演化","authors":"Cristian E. Onete, M. Onete","doi":"10.1109/mocast54814.2022.9837590","DOIUrl":null,"url":null,"abstract":"In this paper we introduce a general representtation of networks that can be modelled as planar graphs, by using oriented incidence matrices. The representation is used to obtain a unitary vision on weighted and non-weighted networks corresponding to circuits that have (or do not have) passive elements between connective nodes. The implications related to the general problem of Hamiltonicity is analyzed, too.","PeriodicalId":122414,"journal":{"name":"2022 11th International Conference on Modern Circuits and Systems Technologies (MOCAST)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graph Evolution Using Oriented Incidence Matrices\",\"authors\":\"Cristian E. Onete, M. Onete\",\"doi\":\"10.1109/mocast54814.2022.9837590\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we introduce a general representtation of networks that can be modelled as planar graphs, by using oriented incidence matrices. The representation is used to obtain a unitary vision on weighted and non-weighted networks corresponding to circuits that have (or do not have) passive elements between connective nodes. The implications related to the general problem of Hamiltonicity is analyzed, too.\",\"PeriodicalId\":122414,\"journal\":{\"name\":\"2022 11th International Conference on Modern Circuits and Systems Technologies (MOCAST)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 11th International Conference on Modern Circuits and Systems Technologies (MOCAST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/mocast54814.2022.9837590\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 11th International Conference on Modern Circuits and Systems Technologies (MOCAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/mocast54814.2022.9837590","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文利用有向关联矩阵，介绍了可以用平面图建模的网络的一般表示。该表示用于获得与连接节点之间具有(或不具有)无源元素的电路相对应的加权和非加权网络的统一视觉。本文还分析了与一般哈密顿性问题有关的含义。

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

查看原文本刊更多论文

Graph Evolution Using Oriented Incidence Matrices

In this paper we introduce a general representtation of networks that can be modelled as planar graphs, by using oriented incidence matrices. The representation is used to obtain a unitary vision on weighted and non-weighted networks corresponding to circuits that have (or do not have) passive elements between connective nodes. The implications related to the general problem of Hamiltonicity is analyzed, too.

求助全文

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

来源期刊

2022 11th International Conference on Modern Circuits and Systems Technologies (MOCAST)

自引率

0.00%

发文量