1,1

Special graph models were constructed (Ibrahim,2009) using an automata scheme invoving some tarnsition function defined on the Special (123)-avoiding permutation patterns reported by Ibrahim and Audu (2005; ibrahim,2008). The orde of these special variety of graph models represents an improvement of the earlier odels(Ibrahim 2008)in the study of the degree/diameter problems as used in circuit designs and analysis. The sequence represents the number of nodes(order) in this latest variety of graph models for primes Pn = 5,7,11,..., ie for Pn>=5.

Ibrahim A.A. (2008) Some Transformation Schemes Involving the Special (132) - avoiding Permutation Patterns and a Binary Coding: An Algorithmic Approach Asian Journal of Algebra 1 (1):10-14, Asian Network for Scientific Information (ANSI), Pakistan

Ibrahim A.A and Audu M.S. (2005) Some Group theoretic Properties of Certain Class of (123) and (132)-Avoiding Patterns Numbers: an enumeration scheme African journal Natural Sciences Vol. 8: 79-84

Ibrahim A.A., and Audu M.S. (2008) On Stable Veriety of Cayley Graphs For Efficient Interconnection Networks Proceedings of Annual National Conference of Mathematical Association of Nigeria (MAN) held at Federal College of Education Technical, Gusau 26th- 30th August, 2008:156-161

T(Bn)= (Pn-2)(Pn-1)+1

For Pn = 5: T(Bn)= (3)(4)+1 = 13; for Pn = 7: T(Bn)= (5)(6)+1 =31

(Other) For Pn>=5 do the following Let T(Bn)= (Pn-2)(Pn-1)+1 Write T(Bn) end

Cf. A160771, A128929, A040976

Sequence in context: A158723 A107288 A095379 this_sequence A039403 A062339 A043226

Adjacent sequences: A160769 A160770 A160771 this_sequence A160773 A160774 A160775

nonn,uned

Aminu Alhaji Ibrahim (aminualhaji(AT)yahoo.co.uk), Jun 09 2009