NDLI: Generalising Laplacian controllability of paths

Content Provider	IET Digital Library
Author	Hsu, Shun Pin Yang, Ping Yen
Abstract	It is well known that if a network topology is a path or line and the states of vertices or nodes evolve according to the consensus policy, then the network is Laplacian controllable by an input connected to its terminal vertex. In this work, a path is regarded as the resulting graph after interconnecting a finite number of two-vertex antiregular graphs and then possibly connecting one more vertex. It is shown that the single-input Laplacian controllability of a path can be extended to the case of interconnecting a finite number of k-vertex antiregular graphs with or without one more vertex appended, for any positive integer k. The methods to interconnect these antiregular graphs and to select the vertex for connecting the single input that renders the network Laplacian controllable are presented as well.
Starting Page	861
Ending Page	868
Page Count	8
ISSN	17518644
Volume Number	13
e-ISSN	17518652
Issue Number	Issue 6, Apr (2019)
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/iet-cta/13/6
Alternate Webpage(s)	https://digital-library.theiet.org/content/journals/10.1049/iet-cta.2018.6214
Journal	IET Control Theory & Applications
Publisher Date	2019-02-27
Access Restriction	Open
Rights Holder	© The Institution of Engineering and Technology
Subject Keyword	Combinatorial Mathematics Control System Analysis Controllability Finite Number Graph Theory Laplace Equation Mathematical Analysis Network Laplacian Controllable Network Topology Single-input Laplacian Controllability Synthesis Method Terminal Vertex Two-vertex Antiregular Graph
Content Type	Text
Resource Type	Article
Subject	Control and Optimization Control and Systems Engineering Human-Computer Interaction Electrical and Electronic Engineering Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Laplacian controllable graphs based on connecting two antiregular graphs

Minimal Laplacian controllability problems of threshold graphs

Swarm stability of linear time-invariant descriptor compartmental networks

State-input constrained asymptotic null-controllability by a set-valued approach

Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks

Single input controllability of a simplified fluid-structure interaction model

Input/output decoupling of Boolean control networks

Distributed average consensus based on structural weight-balanceability

Stochastic finite-time consensualisation for Markov jump networks with disturbance

Generalising Laplacian controllability of paths

Similar Documents

Laplacian controllable graphs based on connecting two antiregular graphs

Minimal Laplacian controllability problems of threshold graphs

Swarm stability of linear time-invariant descriptor compartmental networks

State-input constrained asymptotic null-controllability by a set-valued approach

Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks

Single input controllability of a simplified fluid-structure interaction model

Input/output decoupling of Boolean control networks

Distributed average consensus based on structural weight-balanceability

Stochastic finite-time consensualisation for Markov jump networks with disturbance

Generalising Laplacian controllability of paths