The Concept of In-out Graph and its Application in Cycle Problems in Digraphs

来源 :第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The | 被引量 : 0次 | 上传用户:luo_123
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  In this talk,we introduce the concept of in-out graph of a digraph.An in-out graph of a digraph D is a graph that takes the arc set of D as its vertex set,and two vertices are joined by a red(green)edge if they share a common head(tail)in D.
其他文献
  1993年,Klein和Randi(c)提出了图的电阻距离的概念,且指出电阻距离是定义在图上距离函数,是图的重要的不变量。对于一些复杂图来说,计算其电阻距离非常困难。文中定义了
会议
  An edge k-weighting of a graph G is a function φ:E(G)→{1,2…,k}.An edge k-weighting is proper if ∑e(∈)uφ(u)≠∑e(∈)vφ(v)for every uv∈E(G).
会议
  Let A(G),L(G)and Q(G)be the adjacency tensor,Laplacian tensor and signless Laplacian tensor of r-graph G,respectively.Denote by λ(T) the largest Heigenvalu
会议
  Let G be a connected graph and g a non-negative integer,the g-extra connectivity of G is the minimum cardinality of a set of vertices in G,if it exists,whos
会议
  Let Q(G;x)=det(xI-Q(G))=∑ni=(-1)iφixn-1 be the characteristic polynomial of the signless Laplacian matrix of a graph G of order n.This talk introduces som
会议
  This talk is based on partial results from the following two papers:Partition of a graph into two ycles,Submitted.Vertex-disjoint cycles containing specifie
会议
  The classical firefighter problem is a deterministic discrete-time model of the spread and defence of fire/rumor/decease,which was introduced by Bert Hartne
会议
  The equitable vertex arboricity of a graph G is the minimum integer t so that the set of vertices of G can be equitably partitioned into t subsets,each of w
会议
  Given two graphs G1 and G2,the Ramsey number R(G1,G2)is the smallest integer N such that,for any graph G of order N,either G contains G1 as a subgraph,or th
会议
  There are various matrices that can be associated with graphs.Recently,the results about the Q-spectrum of a graph has been studied extensively.This talk wi
会议