Sharif Digital Repository

In vivo dose-dependent effects of nanoscale graphene oxide (NGO) sheets on reproduction capability of Balb/C mice were investigated. Biodistribution study of the NGO sheets (intravenously injected into male mice at dose of ∼2000 μg/mL or 4 mg/kg of body weight) showed a high graphene uptake in testis. Hence, in vivo effects of the NGO sheets on important characteristics of spermatozoa (including their viability, morphology, kinetics, DNA damage and chromosomal aberration) were evaluated. Significant in vivo effects was found at the injected concentrations ≥200 μg/mL after (e.g., ∼45% reduction in sperm viability and motility at 2000 μg/mL). Observation of remarkable DNA fragmentations and... 

The energy of a graph G, denoted by E (G), is defined as the sum of the absolute values of all eigenvalues of the adjacency matrix of G. It is proved that E (G) ≥ 2 (n - χ (over(G, -))) ≥ 2 (ch (G) - 1) for every graph G of order n, and that E (G) ≥ 2 ch (G) for all graphs G except for those in a few specified families, where over(G, -), χ (G), and ch (G) are the complement, the chromatic number, and the choice number of G, respectively. © 2007 Elsevier Inc. All rights reserved  

Let A be a Hermitian matrix whose graph is G (i.e. there is an edge between the vertices i and j in G if and only if the (i,j) entry of A is non-zero). Let λ be an eigenvalue of A with multiplicity mA(λ). An edge e=ij is said to be Parter (resp., neutral, downer) for λ,A if mA(λ)-mA-e(λ) is negative (resp., 0, positive ), where A-e is the matrix resulting from making the (i,j) and (j,i) entries of A zero. For a tree T with adjacency matrix A a subset S of the edge set of G is called an edge star set for an eigenvalue λ of A, if |S|=mA(λ) and A-S has no eigenvalue λ. In this paper the existence of downer edges and edge star sets for non-zero eigenvalues of the adjacency matrix of a tree is... 

A vector is called nowhere-zero if it has no zero entry. In this article we search for graphs with nowhere-zero eigenvectors. We prove that distance-regular graphs and vertex-transitive graphs have nowhere-zero eigenvectors for all of their eigenvalues and edge-transitive graphs have nowhere-zero eigenvectors for all non-zero eigenvalues. Among other results, it is shown that a graph with three distinct eigenvalues has a nowhere-zero eigenvector for its smallest eigenvalue  

The energy of a graph G, denoted by E (G), is defined as the sum of the absolute values of all eigenvalues of G. Let G be a graph of order n and rank (G) be the rank of the adjacency matrix of G. In this paper we characterize all graphs with E (G) = rank (G). Among other results we show that apart from a few families of graphs, E (G) ≥ 2 max (χ (G), n - χ (over(G, -))), where n is the number of vertices of G, over(G, -) and χ (G) are the complement and the chromatic number of G, respectively. Moreover some new lower bounds for E (G) in terms of rank (G) are given. © 2008 Elsevier B.V. All rights reserved  

In this paper we study graphs all of whose star sets induce cliques or co-cliques. We show that the star sets of every tree for each eigenvalue are independent sets. Among other results it is shown that each star set of a connected graph G with three distinct eigenvalues induces a clique if and only if G = K1, 2 or K2, ..., 2. It is also proved that stars are the only graphs with three distinct eigenvalues having a star partition with independent star sets. © 2008 Elsevier Inc. All rights reserved  

In this paper, we study modules having only finitely many submodules over any ring which is not necessarily commutative. We try to understand how such a module decomposes as a direct sum. We justify that any module V having only finitely many submodules over any ring A is an extension of a cyclic A-module by a finite A-module. Under some assumptions on A, such as commutativity of A, we prove that an A-module V has finitely many submodules if and only if V can be written as a direct sum of a cyclic A-module having only finitely many A-submodules and a finite A-module  

Let R be a ring with non-zero identity. The unit graph G(R) of R is a graph with elements of R as its vertices and two distinct vertices a and b are adjacent if and only if a + b is a unit element of R. It was proved that if R is a commutative ring and is a maximal ideal of R such that |R/| = 2, then G(R) is a complete bipartite graph if and only if (R, ) is a local ring. In this paper we generalize this result by showing that if R is a ring (not necessarily commutative), then G(R) is a complete r-partite graph if and only if (R, ) is a local ring and r = |R/| = 2n for some n ∞ N or R is a finite field. Among other results we show that if R is a left Artinian ring, 2 U(R) and the clique... 

Predominance of nano-scale effects observed in material behavior at small scales requires implementation of new simulation methods which are not merely based on classical continuum mechanic. On the other hand, although the atomistic modeling methods are capable of modeling nano-scale effects, due to the computational cost, they are not suitable for dynamic analysis of nano-structures. In this research, we aim to develop a continuum-based model for nano-beam vibrations which is capable of predicting the results of molecular dynamics (MD) simulations with considerably lower computational effort. In this classical-based modeling, the surface and core regions are taken to have different... 

The energy of a graph/matrix is the sum of the absolute values of its eigenvalues. We investigate the result of duplicating/removing an edge to the energy of a graph. We also deal with the problem that which graphs G have the property that if the edges of G are covered by some subgraphs, then the energy of G does not exceed the sum of the subgraphs' energies. The problems are addressed in the general setting of energy of matrices which leads us to consider the singular values too. Among the other results it is shown that the energy of a complete multipartite graph increases if a new edge added or an old edge is deleted. © 2008 Elsevier Inc. All rights reserved  

Parkinson's disease (PD) is the second most common and progressive neurological disorder. Parkinson's signs are caused by dysfunction in PD patient's brain network. Newly, resting state functional magnetic resonance imaging has been utilized to assess the altered functional connectivity in PD patients. In this study, we investigated the properties of the brain network topology in 19 PD patients compared to 17 normal healthy group by means of graph theory. In addition, we used four different graph formation methods to explore linear and nonlinear relationships between fMRI signals. Each correlation measure created a weighted graph for each subject. Different graph characteristics have been... 

Analytical and numerical system identification (system ID) techniques of smart structures with piezoelements are introduced and compared in this paper. Simplicity and low cost of numerical system ID methods developed here make them beneficial in control design and implementation as well as in optimization of location and size of actuators and sensors of the smart structure. The accuracy of these techniques is then verified using analytical system ID, which derives the dynamic model of the structure from differential equations. In the first numerical system ID technique, Finite Element Method (FEM) is employed to model the dynamic system and to obtain the Frequency Response Function (FRF).... 

The closed neighbourhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end vertex with e. Let f be a function on the edges of G into the set {-1, 1}. If ∑e∈NG[x] f(e) ≥ 1 for every x ∈ E(G), then f is called a signed edge domination function of G. The minimum value of ∑x∈E(G) f(x), taken over every signed edge domination function f of G, is called signed edge domination number of G and denoted by γ's (G). It has been proved that γ's(G) ≥ n - m for every graph G of order n and size m. In this paper we prove that γ's (G) ≥ 2α'(G)-m 3 for every simple graph G, where α'(G) is the size of a maximum matching of G. We also prove that for a simple graph... 

Abstract We design a thermo-photovoltaic Tandem cell which produces high open circuit voltage (Voc) that causes to increase efficiency (η). The currently used materials (AlAsSb-InGaSb/InAsSb) have thermo-photovoltaic (TPV) property which can be a p-n junction of a solar cell, but they have low bandgap energy which is the reason for lower open circuit voltage. In this paper, in the bottom cell of the Tandem, there is 30 quantum wells which increase absorption coefficients and quantum efficiency (QE) that causes to increase current. By increasing the current of the bottom cell, the top cell thickness must be increased because the top cell and the bottom cell should have the same current. In... 

Image segmentation with clustering approach is widely used in biomedical application. Fuzzy c-means (FCM) clustering is able to preserve the information between tissues in image, but not taking spatial information into account, makes segmentation results of the standard FCM sensitive to noise. To overcome the above shortcoming, a modified FCM algorithm for MRI brain image segmentation is presented in this paper. The algorithm is realized by incorporating the spatial neighborhood information into the standard FCM algorithm and modifying the membership weighting of each cluster by smoothing it by Total Variation (TV) denoising. The proposed algorithm is evaluated with accuracy index in... 

Let G be a simple connected graph of order n. Let (Formula presented.) be the Laplacian eigenvalues of G. In this paper, we show that if X and Y are two subsets of vertices of G such that (Formula presented.) and the set of all edges between X and Y decomposed into r disjoint perfect matchings, then, (Formula presented.) where (Formula presented.). Also, we determine a relation between the Laplacian eigenvalues and matchings in a bipartite graph by showing that if (Formula presented.) is a bipartite graph, (Formula presented.) and (Formula presented.), then G has a matching that saturates U. © 2019, © 2019 Informa UK Limited, trading as Taylor & Francis Group  

Given a 2-(v,k,λ) design, S=(X,B), a zero-sumn-flow of S is a map f:B⟶{±1,…,±(n−1)} such that for any point x∈X, the sum of f over all the blocks incident with x is zero. It has been conjectured that every Steiner triple system, STS(v), on v points (v>7) admits a zero-sum 3-flow. We show that for every pair (v,λ) for which a triple system, TS(v,λ), exists, there exists one which has a zero-sum 3-flow, except when (v,λ)∈{(3,1),(4,2),(6,2),(7,1)}. We also give a O(λ2v2) bound on n and a recursive result which shows that every STS(v) with a zero-sum 3-flow can be embedded in an STS(2v+1) with a zero-sum 3-flow if v≡3(mod4), a zero-sum 4-flow if v≡3(mod6) and with a zero-sum 5-flow if v≡1(mod4).... 

A signed graph is a pair like (G,σ), where G is the underlying graph and σ:E(G)→{−1,+1} is a sign function on the edges of G. In this paper we study the spectral determination problem for signed n-cycles (Cn,σ) with respect to the adjacency spectrum and the Laplacian spectrum. In particular, for the Laplacian spectrum, we prove that balanced odd cycles and unbalanced cycles, denoted, respectively, by C2n+1 + and Cn −, are uniquely determined by their Laplacian spectra (i.e., they are DLS). On the other hand, we determine all Laplacian cospectral mates of the balanced even cycles C2n +, so that we show that C2n + is not DLS. The same problem is then considered for the adjacency spectrum,... 

In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than 1 are simple and also the multiplicity of Laplacian eigenvalue 1 has been well studied before. Here we consider the multiplicities of the other (non-integral) Laplacian eigenvalues. We give an upper bound and determine the trees of order n that have a multiplicity that is close to the upper bound [Formula presented], and emphasize the particular role of the algebraic connectivity. © 2019 Elsevier Inc  

A simple catalyst LiClO4/Et3N has been developed and demonstrated to efficiently catalyze Michael addition reactions of active methylene compounds to conjugated ketones, nitriles, esters and nitroalkenes with remarkably high yields and in short reaction time. The Michael addition to nitroalkenes and α,β-unsaturated ketones proceeds quantitatively in the usual way, giving the monoaddition product. © 2008 Elsevier B.V. All rights reserved