Dominating induced matchings and other graph parameters

References

• Akbari, S., Baktash, H., Behjati, A., Behmaram, A., Roghani, M. (2022). Some results on dominating induced matchings. Graphs Combin. 38:73.
   Web of Science ®Google Scholar
• Akbari, S., Ehsani, S., Ghajar, S., Jalaly Khalilabadi, P., Sadeghian Sadeghabad, S. (2016). On the edge Roman domination in graphs. Graphs Combin. 32: 1731–1747.
   Web of Science ®Google Scholar
• Allan, R. B., Laskar, R. (1978). On domination and independent domination numbers of a graph. Discrete Math. 23: 73–76.
   Web of Science ®Google Scholar
• Andova, V., Kardoš, F., Škrekovski, R. (2015). Sandwiching Saturation number of Fullerene graphs. MATCH Commun. Math. Comput. Chem. 73: 501–518.
   Web of Science ®Google Scholar
• Atapour, M., Soltankhah, N. (2009). On total dominating sets in graphs. Int. J. Contemp. Math. Sci. 4: 253–257.
   Google Scholar
• Behmaram, A., Došlić, T., Friedland, S. (2016). Matchings in m-generalized fullerene graphs. Ars Math. Contemp. 11: 301–313.
   Web of Science ®Google Scholar
• Berge, C. (1973). Graphs and Hypergraphs. Amsterdam: North-Holland.
   Google Scholar
• Brandstädt, A., Hundt, C., Nevries, R. (2010). Efficient edge domination on hole-free graphs in polynomial time. Lecture Notes Comput. Sci. 6034: 650–661.
   Google Scholar
• Brandstädt, A., Mosca, R. (2014). Dominating induced matchings for p-free graphs in linear time. Algorithmica 68: 998–1018.
   Web of Science ®Google Scholar
• Cardoso, D. M., Cerdeira, J. O., Delorme, C., Silva, P. C. (2008). Efficient edge domination in regular graphs. Discrete Appl. Math. 156: 3060–3065.
   Web of Science ®Google Scholar
• Cardoso, D. M., Korpelainen, N., Lozin, V. V. (2011). On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discrete Appl. Math. 159: 521–531.
   Web of Science ®Google Scholar
• Cardoso, D. M., Lozin, V. V. (2009). Dominating induced matchings. In: Lipshteyn, Marina, et al. eds. Graph Theory, Computational Intelligence and Thought. Essays Dedicated to Martin Charles Golumbic on the Occasion of his 60th Birthday. Lecture Notes in Computer Science, Vol. 5420. Berlin: Springer, pp. 77–86.
   Google Scholar
• Došlić, T. (2008). Saturation number of fullerene graphs. J. Math. Chem. 43: 647–657.
   Web of Science ®Google Scholar
• Došlić, T. (2019). Block allocation of a sequential resource. Ars Math. Contemp. 17: 79–88.
   Web of Science ®Google Scholar
• Došlić, T., Taheri-Dehkordi, M., Fath-Tabar, G. H. (2020). Packing stars in fullerenes. J. Math. Chem. 58: 2223–2244.
   Web of Science ®Google Scholar
• Došlić, T., Taheri-Dehkordi, M., Fath-Tabar, G. H. (2022). Shortest perfect pseudomatchings in fullerene graphs. Appl. Math. Comput. 424: 127026.
   Web of Science ®Google Scholar
• Došlić, T., Tratnik, N., Žigert Pleteršek, P. (2018). Saturation number of lattice animals. Ars Math. Contemp. 15: 191–204.
   Web of Science ®Google Scholar
• Došlić, T., Zubac, I. (2016). Counting maximal matchings in linear polymers. Ars Math. Contemp. 11: 255–276.
   Web of Science ®Google Scholar
• Goddard, W., Henning, M. A. (2013). Independent domination in graphs: a survey and recent results. Discrete Math. 313: 839–854.
   Web of Science ®Google Scholar
• Goddard, W., Henning, M. A., Lyle, J., Southey, J. (2012). On the independent domination number of regular graphs. Ann. Comb. 16:719–732.
   Web of Science ®Google Scholar
• Grinstead, D. L., Slater, P. J., Sherwani, N. A., Holmes, N. D. (1993). Efficient edge domination problems in graphs. Inf. Process. Lett. 48: 221–228.
   Web of Science ®Google Scholar
• Hertz, A., Lozin, V., Ries, B., Zamaraev, V., de Werra, D. (2018). Dominating induced matchings in graphs containing no long claw. J. Graph Theory 88: 18–39.
   Web of Science ®Google Scholar
• Jou, M.-J., Lin, J.-J. (2015). Independence numbers in trees. Open J. Discrete Math. 5: 27–31.
   Google Scholar
• Koperlaine, N., Lozin, V. V., Purcell, C. (2014). Dominating induced matchings in graphs without a skew star. J. Discrete Algorithms 26:45–55.
   Google Scholar
• Lovász, L., Plummer, M. D. (1986). Matching Theory. Amsterdam: North-Holland.
   Google Scholar
• Mitchell, S., Hedetniemi, S. T. (1977). Edge domination in trees. Congr. Numer. 19: 489–509.
   Google Scholar
• West, D. B. (2001). Introduction to Graph Theory. Upper Saddle River, NJ: Prentice Hall.
   Google Scholar
• ReVelle, C. S. (1997). Can you protect the Roman Empire? Johns Hopkins Mag. 49: 40.
   Google Scholar