1. D. Ahmadi, G.H. Fricke, C. Schroeder, S.T. Hedetniemi, R.C. Laskar, Broadcast irredundance in graphs. Congr. Numer. 224, 17–31 (2015)
2. S. Arumugam, K.R. Chandrasekar, A note on graphs with open irratic number two. Bull. Inst. Combin. Appl. 65, 27–32 (2012)
3. S. Arumugam, S.T. Hedetniemi, S.M. Hedetniemi, L. Sathikala, S. Sudha, The covering chain of a graph. Util. Math. 98, 183–196 (2015)
4. M.W. Bern, E.L. Lawler, A.L. Wong, Why certain subgraph computations require only linear time, in Proc. 26th Ann. Symp. on the Foundations of Computer Science, Portland, OR (1985), pp. 117–125
5. T. Beyer, A. Proskurowski, S. Hedetniemi, S. Mitchell, Independent domination in trees, in Proc. Eighth Southeastern Conf. on Combinatorics, Graph Theory and Computing. Congr. Numer., vol. 19 (1977), pp. 321–328