• <tr id='Mwtk1x'><strong id='Mwtk1x'></strong><small id='Mwtk1x'></small><button id='Mwtk1x'></button><li id='Mwtk1x'><noscript id='Mwtk1x'><big id='Mwtk1x'></big><dt id='Mwtk1x'></dt></noscript></li></tr><ol id='Mwtk1x'><option id='Mwtk1x'><table id='Mwtk1x'><blockquote id='Mwtk1x'><tbody id='Mwtk1x'></tbody></blockquote></table></option></ol><u id='Mwtk1x'></u><kbd id='Mwtk1x'><kbd id='Mwtk1x'></kbd></kbd>

    <code id='Mwtk1x'><strong id='Mwtk1x'></strong></code>

    <fieldset id='Mwtk1x'></fieldset>
          <span id='Mwtk1x'></span>

              <ins id='Mwtk1x'></ins>
              <acronym id='Mwtk1x'><em id='Mwtk1x'></em><td id='Mwtk1x'><div id='Mwtk1x'></div></td></acronym><address id='Mwtk1x'><big id='Mwtk1x'><big id='Mwtk1x'></big><legend id='Mwtk1x'></legend></big></address>

              <i id='Mwtk1x'><div id='Mwtk1x'><ins id='Mwtk1x'></ins></div></i>
              <i id='Mwtk1x'></i>
            1. <dl id='Mwtk1x'></dl>
              1. <blockquote id='Mwtk1x'><q id='Mwtk1x'><noscript id='Mwtk1x'></noscript><dt id='Mwtk1x'></dt></q></blockquote><noframes id='Mwtk1x'><i id='Mwtk1x'></i>

                【校庆学术活动月】图与组合系列讲座之五十七(徐守军)

                发布时间:2020-09-22

                报告题目:Complexity and characterizations of edge-related domination and k-factor-criticality of domination-critical graphs

                报 告 人: 徐守军 教授(兰州大学)

                报告摘要:In this lecture, I will introduce some results on complexity of edge-related domination problems,  and on characterizations for trees with properties about edge-related domination  parameters. Also I will introduce some results on k-factor-critical properties of (connected-) domination critical graphs.

                报告时间: 2020924(周四)  14:30-15:30

                报告地点:腾讯●会议室:237-987-694

                欢迎各位老师、同学届时前往!

                                                                                                   科学技术处

                         2020922

                 


                返回原图
                /