JAM Journal of Applied Mathematics 1687-0042 1110-757X Hindawi Publishing Corporation 510180 10.1155/2012/510180 510180 Research Article Graph Products and Its Applications in Mathematical Formulation of Structures Nouri M. 1 Talatahari S. 2 Shamloo A. Salimi 3 Conca C. 1 Department of Structural Engineering Islamic Azad University Shabestar Branch Shabestar Iran iau.ac.ir 2 Marand Faculty of Engineering University of Tabriz Tabriz 51667 71719 Iran tabrizu.ac.ir 3 Department of Mathematics Islamic Azad University Shabestar Branch Shabestar Iran iau.ac.ir 2012 31 12 2012 2012 15 06 2012 15 10 2012 16 10 2012 2012 Copyright © 2012 M. Nouri et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

The first step in the analysis of a structure is to generate its configuration. Different means are available for this purpose. The use of graph products is an example of such tools. In this paper, the use of product graphs is extended for the formation of different types of structural models. Here weighted graphs are used as the generators and the connectivity properties of different models are expressed in terms of the properties of their generators through simple algebraic relationships. In this paper by using graph product concepts and spatial structured matrices, a new algebraic closed form is proposed for mathematical formulation and presentation of structures. For clarification some examples are included.

1. Introduction

Data generation is the first step in the analysis of every structure. Configuration processing of large scale problems without automatic approaches can be erroneous and occasionally impossible. Formex configuration processing is one such a means introduced by Nooshin  and further developed by Nooshin et al.  and Nooshin and Disney . Similar methods are developed based on set theory by Behravesh et al. . Kaveh applied graph theory for this formation  (see also Kaveh et al. ). The use of product graphs in structural mechanics is suggested in [7, 8] and application of the corresponding concepts utilizing the directed and looped generators is due to Kaveh and Koohestani , weighted graph products by Kaveh and Nouri  and weighted triangular and circular graph products employed by Kaveh and Beheshti .

There are many other references in the field of data generation; however, most of them are prepared for specific classes of a problem. For example, many algorithms have been developed and successfully implemented on mesh or grid generation; a complete review of which may be found in a paper by Thacker  and in the books by Thompson et al. , Liseikin , and Topping et al. .

In this paper the configuration processing of regular structures is considered. A structure is called regular if it can be considered as the product of two or three subgraphs (generators) . The weighted graph products developed in  and their application are extended. Weighted paths and cycles are considered as the generators, and it is shown that many such product graphs can algebraically be expressed by simple relationships and a new algebraic closed form proposed for mathematical formulation and presentation of structures. Once this is done, then the existing methods can be applied to eigensolution and analysis of such structures . However, this paper is limited to the generalization of product graphs for configuration processing of space structures. The methods of this paper can easily be adopted in the mesh generation of the finite element models.

2. Definitions from Graph Theory

A graph S(N,M) consists of a set of elements, N(S), called nodes and a set of elements, M(S), called members, together with a relation of incidence which associates two distinct nodes with each member, known as its ends. If weights are assigned to the members and nodes of a graph, then it becomes a weighted graph, (Figure 1). Two nodes of a graph are called adjacent if these nodes are the end nodes of a member. A member is called incident with a node if that node is an end node of the member. The degree of a node is the number of members incident with that node. A subgraph Si of a graph S is a graph for which N(Si)N(S) and M(Si)M(S), and each member of Si has the same ends as in S. A path graph P is a simple connected graph with N(P)=M(P)+1 that can be drawn in a way that all of its nodes and members lie on a single straight line. A path graph with n nodes is denoted by Pn, and a weighted path is shown by Pnw. A cycle graph C is a simple connected graph with identical number of nodes and members that can be drawn so that all of its nodes and members lie on a circle. A cycle graph with n nodes is shown by Cn, and a weighted cycle is denoted by Cnw. Examples of these graphs are shown in Figure 1. For further definitions the reader may refer to Kaveh [7, 20].

Examples of simple and weighted graphs.

3. Algebraic Representation of Path and Cycles

Most of the space structures can be viewed as the product of some weighted paths and cycles. Therefore in this section some simple mathematical relationships are presented for defining such generators.

3.1. Weighted Path

The adjacency matrix of a path in general can be expressed as (3.1)adj(Pnw)=[W1W1,2W2,1W2W2,3Wn-1,n-2Wn-1Wn-1,nWn,n-1Wn]n×n=[LDU],L=[W2,1W3,2Wn-1,n-2Wn,n-1](n-1)×1,D=[W1W2Wn-1Wn]n×1,U=[W1,2W2,3Wn-2,n-1Wn-1,n](n-1)×1, where the weights are divided into 3 groups, L, D, and U.

Using this definition a weighted path, in general, can be expressed as (3.2)Pnw[LTDTUT].

3.2. Weighted Cycle

The adjacency matrix of a weighted cycle can similarly be expressed as (3.3)adj(Cnw)=[W1W1,2W1,nW2,1W2W2,3Wn-1,n-2Wn-1Wn-1,nWn,1Wn,n-1Wn]n×n=[LDU],L=[W2,1W3,2Wn,n-1W1,n]n×1,D=[W1W2Wn-1Wn]n×1,U=[W1,2W2,3Wn-1,nWn,1]n×1, where the weights are also divided into 3 groups L, D, and U.

Considering these, a weighted cycle, in general, can be shown as (3.4)Cnw[LTDTUT].

3.3. Unit and Zero Vectors

The unit vector is defined as the following.

E n is an n by 1 vector with all entries being 1. In addition En(i) is a vector of the same dimension with all entries as 1 except the entry at ith row which is zero: (3.5)En=n×1,En(i)=n×1ithrow. The zero vector is defined as the following.

O n is an n by 1 vector with all entries being 0. In addition On(i) is a vector of the same dimension with all entries as 0 except the entry at the ith row which is 1: (3.6)On=n×1,On(i)=n×1ithrow.

3.4. Extension of the Zero and Unit Vectors

In this section the zero and unit vectors are extended to represent [L,D,U] in an efficient manner.

If we want to create a vector with some entries as 1 and the remaining also as 0, we use the following expression: (3.7)On(1,2,i,k)=On(1)+On(2)+On(i)+On(k),i,kn.

If we want to create a vector with the I, i+k, i+2k, as 1 and the remaining entries as 0, we use the following expression: (3.8)On(i:k)=On(i)+On(i+k)+On(i+2k)+On(i+3k)++On(m),n-kmn.

For creating a vector with the I, i+k, i+2k,,i+m*k as 1 and the remaining entries as 0, we use the following expression: (3.9)On(i:k:m)=On(i)+On(i+k)+On(i+2k)+On(i+3k)++On(i+mk),i+mkn

For creating a vector with the (I,j,),  (i+k,j+k,),  (i+2k,j+3k,),, and (i+mk,j+mk,) as 1 and the remaining entries as 0, we use the following expression: (3.10)On(i,j,:k:m)=[On(i)+On(j)+]+[On(i+k)+On(j+k)+]+[On(i+2k)+On(j+2k)+]++[On(i+mk)+On(j+mk)+].   In general case the following relation exists between the zero and unit vectors: (3.11)En(i)=En-On(i).

As an example the weighted graphs shown in Figure 2 are expressed in algebraic form.

Some weighted graphs.

In compact algebraic representation the difference between a simple and a weighted graph is illustrated. As an example, for Figures 2(a) and 2(a1), which are both simple paths, a is weighted and a1 is simple, the algebraic representations are as follows: (3.12)(a)P7w[L:E6TD:O7TU:E6T],(a1)P7. For the weighted case L,D, and U are E6T,O7T,E6T, respectively.

In Figure 2(i) a weighted cycle is shown, where L, D, and U are E5T(4,5),O5T(1,4,5),E5T(2), respectively. In the following weighted paths and cycles of Figure 2 are represented algebraically: (3.13)(a,a1)P7=P7w[E6TO7TE6T],(b)P7w[L:E6T(1:2)],(c)P7w[D:O7T(2,3:3)],(d)P7w[L:E6T(1,2:3)D:O7T(1:2)],(e,e1)C5=C5w[E5TO5TE5T],(f)C5w[D:E5T],(g)C5w[L:O5TD:E5T],(h)C5w[D:E5TU:O5T],(i)C5w[E5T(4,5)O5T(1,4,5)E5T(2)].

4. Graph Products

In this section, weighted graph products which are introduced in  are formulated and generalized for configuration processing of structural models. These products are formulated in the algebraic form defined in Section 3. The operators used for each product are provided in Table 1.

Operators of graph products.

Product Operator
Cartesian ×
Strong Cartesian
Direct

Graph products of simple and weighted graphs are fully explained in . For weighted case the first step is the formation of the coordinates of the nodes using the nodes of the generators. As an example, for two paths these nodes are generated in Figure 3.

Nodal coordinate system of the Boolian product of P7 and P5.

4.1. Weighted Cartesian Product

In this product after the formation of the nodes according to the nodes of the generators (Figure 3), a member is added between two typical nodes (Ui,Vj) and (Uk,Vl), (Figure 4), if the following conditions are fulfilled.

Two random nodes selected from a product domain.

We use the weights −1, 0, and +1 to assign to the nodes and elements in order to control the generation of the members and nodes: (4.1)if[(Ui=Uk&Wi=-1&(Wj&Wl)-1&(WjlorWlj)0)or(Vj=Vl&Wj=-1&(Wi&Wk)-1&(WikorWki)0)]orif[(Ui=Uk&Wi=0&(Wjl&Wlj)0)or(Vl=Vj&Wj=0&(Wik&Wki)0)]orif[(Ui=Uk&Wi=1&(WljxorWjl)0)or(Vl=Vj&Wj=1&(WikxorWki)0)].

As an example, Figure 5 illustrates some weighted Cartesian products and their compact representation.

Examples of two weighted Cartesian products.

4.2. Weighted Strong Cartesian Product

In this product after the formation of the nodes, according to the nodes of the generator, (Figure 3), a member is added between two typical nodes (Ui,Vj) and (Uk,Vl), (Figure 4), if the following conditions are fulfilled: (4.2)if(Ui=Uk&(WjlorWlj)0)&[Wi=0or(Wi=-1&(Wj&Wl)-1)]orif(Vj=Vl&(WikorWki)0)&[Wj=0or(Wj=-1&(Wi&Wk)-1)]or((WikorWjl)0or(Wki&Wlj)0).

Examples of strong Cartesian products of weighted graphs and their compact presentations are provided in Figure 6. As it can be observed, the compact products of paths and/or cycles are a powerful means for configuration processing and can be employed similarly to Formex configuration processing of Nooshin .

Different weighted strong Cartesian products of two simple weighted graphs.

4.3. Weighted Direct Product

In this product after the formation of the nodes according to the nodes of the generator (Figure 3), a member is added between two typical nodes (Uk,Vl) and (Ui,Vj), (Figure 4), if the following conditions are fulfilled: (4.3)if[((Wi&Wj)-1or(Wk&Wl)-1)&((Wik&Wjl)0or(Wki&Wlj)0)].

Some examples of these weighted products and their compact representations are illustrated in Figure 7.

Examples of weighted direct products: product of P7wP9w.

5. Geometrical Transformation of Graph Products

In this section using simple transformations, the weighted graph products of the previous section are employed for configuration processing of different types of space structures.

5.1. Transformation between Cartesian Coordinate System and Oblique System

In Cartesian coordinate systems (or rectangular coordinates), the “address’’ of a point P is given by two real numbers indicating the positions of the perpendicular projections from the point to two fixed perpendicular lines, known as the x-axis and the y-axis, and we write P=(x,y), (Figure 8).

Points in the Cartesian coordinate system.

In this figure P=(4,3),  Q=(-1.3,2.5),  R=(-1.5,-1.5),  S=(3.5,-1), and T=(4.5,0). The axes divide the plane into four quadrants: P is in the first quadrant, Q in the second, R in the third, and S in the fourth. T is on the positive x-axis.

The following generalization of Cartesian coordinates is useful for configuration processing of space structures. Consider two axes, intersecting at the origin but not necessarily perpendicularly. Let the angle between these axes be ω. In this system of oblique coordinates, a point P is given by two real numbers indicating the positions of the projections from the point to each axis, in the direction of the other axis (Figure 9). The first axis (x-axis) is generally drawn horizontally. The case ω = 90° yields a Cartesian coordinate system.

Points in an oblique coordinate system.

In this coordinate system we have P=(4,3),  Q=(-1.3,2.5),  R=(-1.5,-1.5), S=(3.5,-1), and T=(4.5,0). Compare to Figure 8.

Connectivity and topological properties of a graph do not depend on its view in a coordinate system. One can present a graph with the same connectivity and different shapes in a different coordinate system.

We use Cartesian and oblique coordinate systems and the transformation between these systems for configuration processing of the space structures, as illustrated in Figure 10.

Transformation between Cartesian and oblique coordinate systems.

5.2. Coordinate Conditions

Additing or restricting the conditions on the domains of the weighted graph products result in different configurations. As an example, additing of the condition (i+j6) on P5w[L:E4T]P5w[U:E4T] and transforming the coordinate system, one can obtain the configuration shown in Figure 11.

Geometrical conditions and transformation between Cartesian and oblique coordinate systems applied to a weighted graph product.

5.3. Stretching of Nodal Point

Moving certain nodes in a graph model can produce different suitable configurations. Examples of such operations from  are shown in Figure 12.

Suitable transformations of nodal coordinates.

6. Generalized Weighted Graph Products

In this section using the previously defined products, transforming the coordinate systems, moving the nodes, adding new conditions to the conditions of different graph products, and also using generalized coordinate systems, the domain of the applications of graph products in configuration processing of space structures is extended.

For configuration processing using the graph products, we extend the forms by defining the coordinate systems shown in Figure 13.

Generalized coordinate systems.

Product of adjacent axes of each coordinate system’s new weighted graph products can be produced. As an example some products of this kind are illustrated in Figure 14. The algebraic form of each configuration is shown in Table 2.

Compact algebraic representation of graph products presented in Figure 14.

 (a) O 2 : P 6 w [ L : E 5 T ] ⊗ P 6 w [ U : E 5 T ] ∣ i + j ≤ 6 (b) O 3 : P 6 w [ L : E 5 T ] ⊗ P 6 w [ U : E 5 T ] ∣ i + j ≤ 6 (c) O 4 : P 6 w [ L : E 5 T ] ⊗ P 6 w [ U : E 5 T ] ∣ i + j ≤ 6 (d) O 5 : P 6 w [ L : E 5 T ] ⊗ P 6 w [ U : E 5 T ] ∣ i + j ≤ 6 (e) O 3 : P 6 w [ L : E 5 T ] ⊗ P 6 w [ U : E 5 T ] (f) O 7 : P 6 w [ L : E 5 T ] ⊗ P 6 w [ U : E 5 T ] ∣ i + j ≤ 6 (g) O 7 : P 6 w [ L : E 5 T ] ⊗ P 6 w [ U : E 5 T ] ∣ 3 < i + j < 6 (h) O 4 : P 6 w [ L : E 5 T ] ⊗ P 6 w [ U : E 5 T ] ∣ 3 < i + j < 6

Weighted graph products in the shown coordinate system.

Figure 14(a) is obtained by the multiplication of axis 1 and axis 2, where the characteristics of the axes are shown in algebraic form in Table 2. Figure 14(b) is formed by multiplication of axis 1 by 2, axis 2 by 3, and axis 3 by 1. The remaining configurations of Figure 14 are obtained similarly by multiplication of each pair of adjacent axes. The properties of the axes are provided in Table 2.

The mathematical formulations of the configurations in Figure 14 are provided in Table 2. In these relationships the type of the coordinate system, the generators, the type of the products, and the imposed conditions are provided.

7. Examples

In this section, the generalized weighted graph products examples of different configurations are formulated. First the configuration is formed and then appropriate geometric transformations are imposed to generate the final configuration of the models.

Examples of Cartesian, strong Cartesian, and direct products are illustrated in Figure 15. For each case, the compact formulation is provided underneath the corresponding figure.

Different configurations in generalized graph products.

8. Conclusions

In this paper the graph products and their applications in configuration processing are extended. Topology of a structure is viewed as the product of two weighted subgraphs like paths and/or cycles as its generators. The paths and cycles are formulated in a mathematical form, and the configuration of a space structure is expressed as different products of these weighted subgraphs as one expression. In the presented method the topological information of space structures can be stored as simple algebraic relationships. More complex configurations can be formulated using different graph theory operators and new conditions can be added to the domains of the products. The application of the introduced products of weighted graphs can also be extended to the mesh generation of finite element models.

Acknowledgment

M. Nouri is grateful for the support of the Shabestar Branch, Islamic Azad University.

Nooshin H. Algebraic representation and processing of structural configurations Computers and Structures 1975 5 2-3 119 130 2-s2.0-0016521595 10.1016/0045-7949(75)90002-4 ZBL0318.73069 Nooshin H. Disney P. Yamamoto C. Formian 1993 Essex, UK Multi-Science Publishers Nooshin H. Disney P. Formex configuration processing III International Journal of Space Structures 2002 17 1 1 50 2-s2.0-14744275494 10.1260/026635102760123042 Behravesh A. Kaveh A. Nani M. Sabet S. A set theoretical approach for configuration processing Computers & Structures 1988 30 6 1293 1302 10.1016/0045-7949(88)90194-0 MR975820 ZBL0664.73048 Kaveh A. A graph-theoretical approach to configuration processing Computers and Structures 1993 48 2 357 363 2-s2.0-0027626881 10.1016/0045-7949(93)90428-G ZBL0778.73084 Kaveh A. Jia X. Weng Q. Rotation as a general operation for configuration processing Scientia Iranica 2010 17 2 131 140 2-s2.0-77952981717 ZBL1191.05089 Kaveh A. Optimal Structural Analysis 2006 2nd Somerset, UK John Wiley & Sons xx+512 MR2244824 Kaveh A. Rahami H. An efficient method for decomposition of regular structures using graph products International Journal for Numerical Methods in Engineering 2004 61 11 1797 1808 10.1002/nme.1126 MR2099954 ZBL1075.74539 Kaveh A. Koohestani K. Graph products for configuration processing of space structures Computers and Structures 2008 86 11-12 1219 1231 2-s2.0-43049162168 10.1016/j.compstruc.2007.11.005 Kaveh A. Nouri M. Weighted graph products for configuration processing of planar and space structures International Journal of Space Structures 2009 24 1 13 26 2-s2.0-73449118923 10.1260/026635109788251494 Kaveh A. Beheshti S. Weighted triangular and circular graph products for configuration processing Periodica Polytechnica 2012 56 1 9 Thacker W. C. A brief review of techniques for generating irregular computational grids International Journal for Numerical Methods in Engineering 1980 15 9 1335 1341 2-s2.0-0019059269 10.1002/nme.1620150906 ZBL0438.76003 Thompson J. F. Warsi Z. U. A. Mastin C. W. Numerical Grid Generation, Foundations and Applications 1985 Amsterdam, The Netherlands Elsevier MR791004 Liseikin V. D. Grid Gneration Methods 1999 Berlin, Germany Springer Scientific Computation MR1707310 Topping B. H. V. Muylle J. Ivanyi P. Finite Element Mesh Generation 2004 Pubn, UK Saxe Coburg Imrich W. Klavžar S. Product Graphs 2000 New York, NY, USA Wiley-Interscience Structure and Recognition MR1788124 Kaveh A. Rahami H. A unified method for eigendecomposition of graph products Communications in Numerical Methods in Engineering 2005 21 7 377 388 10.1002/cnm.753 MR2151527 ZBL1066.05087 Kaveh A. Nikbakht M. Rahami H. Improved group theoretic method using graph products for the analysis of symmetric-regular structures Acta Mechanica 2010 210 3-4 265 289 2-s2.0-77949267729 10.1007/s00707-009-0204-1 Kaveh A. Rahami H. An efficient analysis of repetitive structures generated by graph products International Journal for Numerical Methods in Engineering 2010 84 1 108 126 10.1002/nme.2893 MR2732315 ZBL1202.74083 Kaveh A. Structural Mechanics: Graph and Matrix Methods 2004 3rd Somerset, UK Research Studies Press