Author:
Eroh Linda,Kang Cong X.,Yi Eunjeong
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics
Reference29 articles.
1. Aazami, A.: Hardness results and approximation algorithms for some problems on graphs. Ph.D. thesis, University of Waterloo, 2008
2. AIM Minimum Rank-Special Graphs Work Group (Barioli, F., Barrett, W., Butler, S., Cioabă, S. M., Cvetković, D., Fallat, S. M., Godsil, C., Haemers, W., Hogben, L., Mikkelson, R., Narayan, S., Pryporova, O., Sciriha, I., So, W., Stevanović, D., van der Holst, H., Vander Meulen, K., Wehe, A. W.): Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl., 428(7), 1628–1648 (2008)
3. Bailey, R. F., Cameron, P. J.: Base size, metric dimension and other invariants of groups and graphs. Bull. London Math. Soc., 43(2), 209–242 (2011)
4. Barioli, F., Barrett, W., Fallat, S. M., et al.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl., 433, 401–411 (2010)
5. Berman, A., Friedland, S., Hogben, L., et al.: An upper bound for the minimum rank of a graph. Linear Algebra Appl., 429, 1629–1638 (2008)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献