العدد الأساس للاتصال الرباعي للبيانات

Abstract EN

The basis number, b(G) ,of a graph G is defined to be the smallest positive integer k such that G has a k-fold basis for its cycle space.

We investigate an upper bound for ( ) 1 2 3 4 b G +G +G +G .It is proved that, if 1 2 3 G ,G ,G and 4 G are connected vertex-disjoint graphs and each has a spanning tree of vertex degree not more than 4, then ( ) max{4,b(G ) 1,b(G ) 2,b(G ) 2,b(G ) 1}.

1 2 3 4 1 2 3 4 b G +G +G +G £ + + + + The basis number of quadruple join of paths, are studied.

It is proved that ( ) 4, , t 5 , 6.

m b P + P + P + P = "m ³ and n p ³