湖南第一师范学院陈静教授学术报告

时间:2021-04-16浏览:185设置

题目:Circuit Covers in Signed Graphs

报告人:陈静

时间:2021年4月20  下午3:30-4 :  30

地点:数计学院20幢308


摘要:Let G be a signed graph and F a set of signed circuits in G. F is a signed circuit cover of G if each edge of G is covered at least once by F, and a signed circuit k-cover of G if each edge of G is covered exactly k times by F. The existence of a signed circuit cover in G is equivalent to the existence of a nowhere-zero flow in G. G is coverable if it has a signed circuit cover. In this talk, we will present some results on shortest signed circuit covers and circuit k-covers in coverable signed graphs.


报告人简介:陈静    湖南第一师范学院教授


浙江师范大学离散数学研究中心版权所有 © 2018-2028
地址:浙江省金华市迎宾大道688号21幢 邮政编码:321004
联系电话:0579-82282629   电子邮箱:jcsx@zjnu.cn    管理登陆