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

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

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

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

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

                 


                返回原图
                /