Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 223

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

On the Reachability and Observability of Path and Cycle Graphs

Parlangeli, G., Notarstefano, G. · 2012 · IEEE Transactions on Automatic Control

Abstract

In this technical note we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. Specifically, we provide necessary and sufficient conditions, based on simple rules from number theory, to characterize all and only the nodes from which the network system is reachable (respectively observable). Interesting immediate corollaries of our results are: i) a path graph is reachable (observable) from any single node if and only if the number of nodes of the graph is a power of two,n = 2i; i ∈N and ii) a cycle is reachable (observable) from any pair of nodes if and only if n is a prime number. For any set of control (observation) nodes, we provide a closed form expression for the (unreachable) unobservable eigenvalues and for the eigenvectors of the (unreachable) unobservable subsystem.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tac.2011.2168912

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 223

Metadata

Authors
Parlangeli, G., & Notarstefano, G.
Venue
IEEE Transactions on Automatic Control
Published
2012-03
Volume
57
Issue
3
Pages
743-748
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W1977594883
Cited by
223
References
2
FWCI
14.34
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.