Please use this identifier to cite or link to this item:
|標題:||Laplacian controllable graphs based on connecting two antiregular graphs||作者:||Shun-Pin Hsu
|關鍵字:||controllability;graph theory||Project:||IET Control Theory & Applications, Volume 12, Issue 16, Page(s) 2213-2220||摘要:||
The Laplacian controllability of combined graphs are studied. It is shown that an antiregular graph, namely, a connected simple graph with exactly two vertices having the same degree, can be connected to another antiregular graph by a newly added edge, and becomes a Laplacian controllable graph under one controller. The methods to identify the vertices connected by the new edge and to assign the control vectors that render the resulting graph Laplacian controllable are presented. Numerical examples are given to illustrate the authors work.
|Appears in Collections:||電機工程學系所|
Show full item record
Files in This Item:
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.