A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x
6
2
ep
S
7
]
O
C
.
th
a
m
[
2
v
2
2
1
9
6
/
tha
m
:v
i
Xr
aSigneddegreesetsinsignedbipartitegraphsS.Pirzada1,T.A.Naikoo2andF.A.Dar3DepartmentofMathematics,UniversityofKashmir,Srinagar-190006,India1Email:sdpirzada@yahoo.co.in2Email:tariqnaikoo@redi mail.com3Email:sfarooqdar@yahoo.co.inAMSClassi cation:05CAbstractAsignedbipartitegraphG(U,V)isabipartitegraphinwhicheachedgeisassignedapositiveoranegativesign.ThesigneddegreeofavertexxinG(U,V)isthenumberofpositiveedgesincidentwithxlessthenumberofnegativeedgesincidentwithx.ThesetSofdistinctsigneddegreesoftheverticesofG(U,V)iscalleditssigneddegreeset.Inthispaper,weprovethateverysetofintegersisthesigneddegreesetofsomeconnectedsignedbipartitegraph.1.IntroductionAsignedgraphisagraphinwhicheachedgeisassignedapositiveoranegativesign.TheconceptofsignedgraphsisgivenbyHarary[3].LetGbeasignedgraphwithvertexsetV={v1,v2,...,vn}.ThesigneddegreeofavertexviinGisdenotedbysdeg(vi)(orsimplyd+ nandd+bydi)andisde nedasdi=i-di,where1≤i≤i(d i)isthenumberofpositive(negative)edgesincidentwithvi.Asigneddegreesequenceσ=[d1,d2,...,dn]ofasignedgraphGisformedbylistingthevertexsigneddegreesinnon-increasingorder.Anintegralsequenceiss-graphicalifitisthesigneddegreesequenceofasignedgraph.Also,anon-zero nsequenceσ=[d1,d2,...,dn]isastandardsequenceifσ
isnon-increasing,i=1diiseven,d1>0,each|di|<n,and|d1|≥|dn|.Thefollowingresult[1],givesanecessaryandsu cientconditionforanintegralsequencetobes-graphical,whichissimilartoHakimi’sresultfordegreesequencesingraphs[2].
Theorem1.1.Astandardintegralsequenceσ=[d1,d2,...,dn]iss-graphicalifandonlyif
1
Signed degree sets in signed graphs The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In thi...
Signed degree sets in si... 暂无评价 6页 免费 Counting 1-factors in re...Dependent Rounding in Bipartite Graphs Rajiv Gandhi Samir Khullery Srinivasan Par...
On Estimating Degree Dis... 暂无评价 11页 免费 Domination in Graphs of ... 12页 免费 Estimating and Exploitin... 8页 免费 Signed degree sets in si...
Maximum Degrees in Hidden Bipartite Graphs隐藏>> ...sets B and W , the goal is to nd the k ...General Terms: Theory Keywords: Maximum Degree, ...
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael...V (G) × V (G) denote the sets of vertices...In general, we are interested in degree ...
t-matchings in bipartite graphs Andras Frankt-matchings in bipartite graphs Andras Frank隐藏>> ?? ?? ? ??? ? ??? ? ? ? ?? ?? ?? ? × ? ?...
2 Regular bipartite graphs We will state some basic results concerning P-feasible sets in regular bipartite graphs. Proposition 2.1 In a -regular ...
Bisection Problem on Bipartite Graphs Bisection Problem is to patition a given graph G into subgraphs G1 and G2 of equal size with minimum number of cu...
Eigenvalues and degree deviation in graphs_数学_自然...Let G be a bipartite graph A, B be its ...V are disjoint sets, write e S , S for the...
FORCING SIGNED DOMINA... 9页 免费 Distance domination...graphs Bipartite graphs Circular-arc graphs Split ...The out-degree of v∈VH of an induced subgrap...
Signed degree sets in si... 暂无评价 6页 免费 Edge-coloring bipartite ....Drawing Clustered Bipartite Graphs in Multi-circular Style 图可视化图可视化隐藏...
热门文档