Perfecting matching of an undirected dense based on geometric multiplicity
Author:
Jini J. ,Hemalatha S.
Reference5 articles.
1. Yunyun Yang and Gang Xie, Maximum Matchings of a Digraph Based on the Largest Geometric Multiplicity, Mathematical Problems in Engineering, Article ID 4702387(2016).
2. Controllability of complex networks
3. Z. Z. Yuan, C. Zhao, Z. R. Di, W.X. Wang and Y.C. Lai, Exact controllability of complex networks, Nature Communications, vol. 4, article 2447(2013).
4. M.L.J. Hautus, Controllability and observability conditions of linear autonomous systems, Indagationes Mathematicae (Proceedings), vol. 72(5) (1969), pp. 443–448.
5. Jini J. and Hemalatha S., Perfect Matching of Bridge Graph based on Geometric and Algebraic Multiplicity, Journal of Xidian University, Volume 14(11)(2020).