http://iet.metastore.ingenta.com
1887

Laplacian controllable graphs based on connecting two antiregular graphs

Laplacian controllable graphs based on connecting two antiregular graphs

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Control Theory & Applications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cta.2018.5484
Loading

Related content

content/journals/10.1049/iet-cta.2018.5484
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address