1
1735-4463
ACECR at Tarbiat Modares University
19
General
THE EFFECT OF PURE SHEAR ON THE REFLECTION OF PLANE WAVES AT THE BOUNDARY OF AN ELASTIC HALF-SPACE
W. HUSSAIN
1
11
2007
2
2
1
16
06
09
2006
26
10
2015
This paper is concerned with the effect of pure shear on the reflection from a plane boundary of infinitesimal plane waves propagating in a half-space of incompressible isotropic elastic material. For a special class of constitutive laws it is shown that an incident plane harmonic wave propagating in the considered plane gives rise to a surface wave in addition to a reflected wave (with angle of reflection equal to the angle of incidence) although its amplitude may vanish at certain discrete angles but is independent of the state of deformation. Reflected wave amplitude is exactly equal to one in this case.For a second class of constitutive laws similar behavior is found for certain combinations of angle of incidence, material properties and deformations, but additional possibilities also arise. In particular, there may be two reflected waves instead of one reflected wave and a surface wave. Here surface wave amplitude depends upon the pure shear and the reflected wave amplitude is not equal to one in general.The dependence of the amplitudes of the reflected, and surface waves on the angle of incidence, the states of deformation is illustrated graphically.
20
General
A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
M. GHORBANI
M. JALALI
1
11
2007
2
2
17
23
06
09
2006
26
10
2015
Dendritic macromoleculesâ€™ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
21
General
A SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
B. MANOUCHEHRIAN
A. R. ASHRAFI
1
11
2007
2
2
25
28
06
09
2006
26
10
2015
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters to find their detour index.
22
General
THE AUTOMORPHISM GROUP OF FINITE GRAPHS
G. H. FATH TABAR
1
11
2007
2
2
29
33
06
09
2006
26
10
2015
Let G = (V,E) be a simple graph with exactly n vertices and m edges. The aim of this paper is a new method for investigating nontriviality of the automorphism group of graphs. To do this, we prove that if |E| >=[(n - 1)2/2] then |Aut(G)|>1 and |Aut(G)| is even number.
23
General
NORMED HYPERVECTOR SPACES
P. RAJA
S. M. VAEZPOUR
1
11
2007
2
2
35
44
06
09
2006
26
10
2015
The main purpose of this paper is to study normed hypervector spaces. We generalize some definitions such as basis, convexity, operator norm, closed set, Cauchy sequences, and continuity in such spaces and prove some theorems about them.
24
General
FINDING HIGHLY PROBABLE DIFFERENTIAL CHARACTERISTICS OF SUBSTITUTION-PERMUTATION NETWORKS USING GENETIC ALGORITHMS
M. ABADI
B. SADEGHIAN
A. GHAEMI
M. A. ALIPOUR
1
11
2007
2
2
45
56
06
09
2006
26
10
2015
In this paper, we propose a genetic algorithm, called GenSPN, for finding highly probable differential characteristics of substitution permutation networks (SPNs). A special fitness function and a heuristic mutation operator have been used to improve the overall performance of the algorithm. We report our results of applying GenSPN for finding highly probable differential characteristics of Serpent block cipher. A comparison of the resultant characteristics with the previously published works shows that GenSPN can find differential characteristics of higher probabilities.
77
General
MORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES
C. Adiga
Z. Khoshbakht
I. Gutman
1
11
2007
2
2
57
62
23
11
2009
26
10
2015
The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G. Several classes of graphs are known that satisfy the condition E(G) > n , where n is the number of vertices. We now show that the same property holds for (i) biregular graphs of degree a b , with q quadrangles, if q<= abn/4 and 5<=a < b = 0 (iii) triregular graphs of degree 1, a, b that are quadrangle-free, whose average vertex degree exceeds a , that have not more than 12n/13 pendent vertices, if 5<= a < b<=((a - 1)^2)/2 .