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

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

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

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

              <i id='tCggE4'><div id='tCggE4'><ins id='tCggE4'></ins></div></i>
              <i id='tCggE4'></i>
            1. <dl id='tCggE4'></dl>
              1. <blockquote id='tCggE4'><q id='tCggE4'><noscript id='tCggE4'></noscript><dt id='tCggE4'></dt></q></blockquote><noframes id='tCggE4'><i id='tCggE4'></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

                 


                返回原图
                /