Title
The Diameters of Almost All Bi-Cayley Graphs.
Abstract
Let G be a finite group of order n and S (possibly, contains the identity element) be a subset of G. The Bi-Cayley graph BC(G, S) of G is a bipartite graph with vertex set G x {0,1} and edge set {{(g, 0), (gs, 1)}vertical bar g is an element of G, s is an element of S}. Let p (0 < p < 1) be a fixed number. We define B = {X = BC(G, S), S subset of G} as a sample space and, assign a probability measure by requiring P-r(X) = p(k)q(n-k), for X = BC(G, S) with vertical bar S vertical bar = k. Here it is shown that the probability of the set of Bi-Cayley graph of G with diameter 3 approaches 1 as the order n of G approaches infinity.
Year
Venue
Keywords
2013
ARS COMBINATORIA
Bi-Cayley graph,Random,Diameter
Field
DocType
Volume
Discrete mathematics,Combinatorics,Cayley graph,Mathematics
Journal
111
ISSN
Citations 
PageRank 
0381-7032
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Xingchao Deng111.11
Jixiang Meng235355.62