شماره ركورد كنفرانس :
3806
عنوان مقاله :
Bicircular Matroid of a Splitting Graph
عنوان به زبان ديگر :
Bicircular Matroid of a Splitting Graph
پديدآورندگان :
Ghorbani V v.ghorbani@urmia.ac.ir Urmia University , Azadi G gh.azadi@urmia.ac.ir Urmia University , Azanchiler H. 1Department of Mathematics, Urmia University, Urmia, Iran
كليدواژه :
Matroid , Bicircular matroid , Splitting operation , Submodular function.
عنوان كنفرانس :
دهمين كنفرانس ملي نظريه گراف و تركيبات جبري
چكيده فارسي :
A bicircular matroid B(G) is a matroid defined on the edge set of a graph G. Two different graphs can have the same bicircular matroid. Splitting operation on two adjacent edges x, y of G, denoted by Gx,y. In this paper, we characterize the set of circuits of B(Gx,y) in terms of the set of circuits of B(G). To do this, we use the submodular function. Then we answer the questionthatwhenthebicircularmatroidsofagivengraph G anditssplitting are equal.
چكيده لاتين :
A bicircular matroid B(G) is a matroid defined on the edge set of a graph G. Two different graphs can have the same bicircular matroid. Splitting operation on two adjacent edges x, y of G, denoted by Gx,y. In this paper, we characterize the set of circuits of B(Gx,y) in terms of the set of circuits of B(G). To do this, we use the submodular function. Then we answer the question that when the bicircular matroids of a given graph G and its splitting are equal.
