一类多输入拉普拉斯可控图

2018 IEEE 14th International Conference on Automation Science and Engineering (CASE) Pub Date : 2018-08-01 DOI:10.1109/COASE.2018.8560603

Ping Yang, S. Hsu

{"title":"一类多输入拉普拉斯可控图","authors":"Ping Yang, S. Hsu","doi":"10.1109/COASE.2018.8560603","DOIUrl":null,"url":null,"abstract":"In this paper we consider the Laplacian controllability problem of combining two special threshold graphs. We form this combination by connecting two identical and connected threshold graphs which have exactly one repeated degree. With appropriate selection of connecting vertices for combination we show how to use the minimum number of inputs to render the combined graph Laplacian controllable. Numerical examples are provided to demonstrate our work.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"54 1","pages":"310-315"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On a class of multi-input laplacian controllable graphs\",\"authors\":\"Ping Yang, S. Hsu\",\"doi\":\"10.1109/COASE.2018.8560603\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the Laplacian controllability problem of combining two special threshold graphs. We form this combination by connecting two identical and connected threshold graphs which have exactly one repeated degree. With appropriate selection of connecting vertices for combination we show how to use the minimum number of inputs to render the combined graph Laplacian controllable. Numerical examples are provided to demonstrate our work.\",\"PeriodicalId\":6518,\"journal\":{\"name\":\"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)\",\"volume\":\"54 1\",\"pages\":\"310-315\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COASE.2018.8560603\",\"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 IEEE 14th International Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2018.8560603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文研究了两个特殊阈值图组合的拉普拉斯可控性问题。我们通过连接两个相同和连接的阈值图来形成这种组合，这两个阈值图只有一个重复度。通过适当选择连接顶点进行组合，我们展示了如何使用最少的输入数来呈现组合图的拉普拉斯可控。给出了数值算例来说明我们的工作。

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

查看原文本刊更多论文

On a class of multi-input laplacian controllable graphs

In this paper we consider the Laplacian controllability problem of combining two special threshold graphs. We form this combination by connecting two identical and connected threshold graphs which have exactly one repeated degree. With appropriate selection of connecting vertices for combination we show how to use the minimum number of inputs to render the combined graph Laplacian controllable. Numerical examples are provided to demonstrate our work.

求助全文

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

来源期刊

2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)

自引率

0.00%

发文量