学术报告|
当前位置:首页 > 科研 > 学术报告
发表时间:2017-12-28 阅读次数:434次
报告题目: Flows and Circuit Covers in Signed Graphs
报 告 人:Prof. Genghua Fan
报告人所在单位:Center for Discrete Mathematics Fuzhou University
报告日期:2017-12-28 星期四
报告时间:15:00-16:00
报告地点:光华东主楼2201
  
报告摘要:

A signed graph G is a graph associated with a mapping σ: E(G)→{-1,1}. Signed graphs can be used to present surface duals of digraphs embedded in non-orientable surfaces. The edges of a signed circuit in a signed graph correspond to a minimal dependent set in the signed graphic matroid. A signed graph is coverable if each edge is contained in some signed circuit. An oriented signed graph (bidirected graph) has a nowhere-zero integer flow if and only if it is coverable. A signed circuit cover of G is a collection of signed circuits which covers all the edges of G. The length of a signed circuit cover is the sum of the lengths (number of edges) of the signed circuits in the cover. The minimum length of a signed circuit cover of G is denoted by scc (G). In this talk, we give a brief survey of recent results on scc (G).

海报

 

  
本年度学院报告总序号:311

Copyright © |2012 复旦大学数学科学学院版权所有 沪ICP备042465  

电话:+86(21)65642341 传真:+86(21)65646073