A sufficient condition for cactus-expandability of graphs

@article{Azuma2017ASC,
  title={A sufficient condition for cactus-expandability of graphs},
  author={Shun-ichi Azuma and Toshimitsu Kure and Toshiharu Sugie},
  journal={2017 IEEE 56th Annual Conference on Decision and Control (CDC)},
  year={2017},
  pages={4394-4397}
}
Cactus graphs, which are connected graphs with no edge contained in two or more different simple cycles, are known to provide useful properties for network systems. Meanwhile, it has been found that a non-cactus graph can be equivalently transformed into a cactus graph by using a conventional technique for simplifying block diagrams; however, the condition under which such transformation is possible has never been clarified so far. This paper addresses the problem of finding graphs which can be… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Structural bistability analysis of Boolean networks

2016 IEEE 55th Conference on Decision and Control (CDC) • 2016

Structural oscillatority analysis of Boolean networks

2015 54th IEEE Conference on Decision and Control (CDC) • 2015
View 1 Excerpt

Structural controllability of multi-agent systems

2009 American Control Conference • 2009
View 1 Excerpt

Topological criteria for nonlinear resistive circuits containing controlled sources to have a unique solution

T. Nishi, L. Chua
IEEE Transactions on Circuits and Systems, vol. CAS-31, no. 8, pp. 722– 741, 2008. • 2008
View 1 Excerpt

Structural controllability

C. Lin
IEEE Transactions on Automatic Control, vol. 19, no. 3, pp. 201–208, 1974. • 1974
View 1 Excerpt