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

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

On State-dependent dynamic graphs and their controllability properties

Mesbahi, M.·2005·IEEE Transactions on Automatic Control

Abstract

We consider distributed dynamic systems operating over a graph or a network. The geometry of the network is assumed to be a function of the underling system's states-giving it a unique dynamic character. Certain aspects of the resulting abstract structure, having a mixture of combinatorial and system theoretic features, are then studied. In this venue, we will explore an interplay between notions from extremal graph theory and system theory by considering a controllability framework for such state-dependent dynamic graphs.

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/tac.2005.843858

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Show all 2 references

Cited by

See all 161

Metadata

Authors
Mesbahi, M.
Venue
IEEE Transactions on Automatic Control
Published
2005-03
Volume
50
Issue
3
Pages
387-392
ISSN
0018-9286 (ISSN-L)
OpenAlex
W2129078098
Cited by
161
References
2
FWCI
20.45
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: On State-dependent dynamic graphs and their controllability properties. https://app.cochat.ai/papers/10.1109/tac.2005.843858
The paper
Mesbahi, M. (2005). On State-dependent dynamic graphs and their controllability properties. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2005.843858

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.