The Average Covering Number of a Graph

Basavanagoud, B., & Hosamani, S. M. (2012). Edge Dominating Graph of a Graph. Tamkang Journal of Mathematics, 43(4), 603-608. https://www.airitilibrary.com/Article/Detail?DocID=00492930-201212-201212270034-201212270034-603-608
Chelvam, T. T., & Chellathurai, S. R. (2009). Complementary Nil Domination Number of a Graph. Tamkang Journal of Mathematics, 40(2), 165-172. https://www.airitilibrary.com/Article/Detail?DocID=00492930-200906-200911130022-200911130022-165-172
Aslan, E. (2014). The Average Lower Connectivity of Graphs. Journal of Applied Mathematics, 2014(), 829-832-785. https://doi.org/10.1155/2014/807834
CHARTRAND, G., FINK, J. F., & ZHANG, P. (2003). THE HULL NUMBER OF AN ORIENTED GRAPH. International Journal of Mathematics and Mathematical Sciences, 2003(), 2265-2275-172. https://doi.org/10.1155/S0161171203210577
Kırlangıc, A., & Turan, G. B. (2012). ON THE RUPTURE DEGREE OF A GRAPH. Neural Network World, 22(1), 39-51. https://doi.org/10.14311/NNW.2012.22.003