Sharif Digital Repository

An analytical method is presented that can be used to determine the behavior of a particular steel beam-to-column extended end plate connection, in both linear and non-linear regions. This article demonstrates a closed form solution of the equations of deformation, for this type of connection. Besides, a step-by-step analytical procedure for establishment of the linear part of M-θ curve of this form of connection is developed. However, this technique can properly be extended to the non-linear regions, which is not considered in this article. The correctness of the results has been ascertained by a comparison, using non-linear finite element models as well as experimental approach; and very... 

Let G be a 2k-edge-connected graph with 𝑘 ≥ 0 and let 𝐿(𝑣) ⊆ {𝑘,…, 𝑑𝐺(𝑣)} for every 𝑣 ∈ 𝑉 (𝐺). A spanning subgraph F of G is called an L-factor, if 𝑑𝐹 (𝑣) ∈ 𝐿(𝑣) for every 𝑣 ∈ 𝑉 (𝐺). In this article, we show that if (Formula presented.) for every 𝑣 ∈ 𝑉 (𝐺), then G has a k-edge-connected L-factor. We also show that if 𝑘 ≥ 1 and (Formula presented.) for every 𝑣 ∈ 𝑉 (𝐺), then G has a k-edge-connected L-factor. © 2018 Wiley Periodicals, Inc  

A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm. © 2018 Elsevier B.V  

In this paper, we introduce a new property for graphs called bounded fragmentation, by which we mean after removing any set of at most k vertices the number of connected components is bounded only by a function of k. We demonstrate how bounded fragmentation can be used to measure the reliability of a network and introduce several classes of bounded fragmentation graphs. Finally, we pose some open problems related to this concept. © 2003 Elsevier Ltd. All rights reserved  

In this paper, the semi-rigid connections, such as Double-angle Web (DW) connections, which are welded to the beam web and bolted to the column ange, are investigated. This study tries to establish the eect of clearance setback between beam end and column ange and/or web. When the beam rotates, it is desirable to avoid bottom ange of the beam bearing against the column as this can induce large forces on the connection. The usual way of achieving this is to ensure that the connection extends at least a few millimeters beyond the end of beam. For this purpose, several connections are designed and considered based on two dierent shear capacities for the beam. For each connection, two dierent... 

In this paper1 we consider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the nth mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set of n disjoint subsets of the vertex set of the graph. We show that the second mean isoperimetric constant in this general setting, coincides with (the mean version of) the classical Cheeger constant of the graph, while for the rest of the spectrum we show that there is a fundamental difference between the nth isoperimetric constant and the number obtained by taking the minimum over all n-partitions. In this direction, we show that our definition is the... 

We construct a model based on a new U(1) X gauge symmetry and a discrete Z 2 symmetry under which the new gauge boson is odd. The model contains new complex scalars which carry U(1) X charge but are singlets of the Standard Model. The U(1) X symmetry is spontaneously broken but the Z 2 symmetry is maintained, making the new gauge boson a dark matter candidate. In the minimal version there is only one complex scalar field but by extending the number of scalars to two, the model will enjoy rich phenomenology which comes in various phases. In one phase, CP is spontaneously broken. In the other phase, an accidental Z 2 symmetry appears which makes one of the scalars stable and therefore a dark... 

Liu and Xu (1998) and Ellingham, Nam and Voss (2002) independently showed that every k-edge-connected simple graph G has a spanning tree T such that for each vertex v, dT(v) ≤ ⌈ d(v)/k ⌉ + 2. In this paper we show that every k-edge-connected graph G has a spanning tree T such that for each vertex v, dT(v)≤ ⌈ d(v)-2/k ⌉ + 2; also if G has k edge-disjoint spanning trees, then T can be found such that for each vertex v, dT(v) ≤ ⌈ d(v)-1/k ⌉ + 1. This result implies that every (r-1)-edge-connected r-regular graph (with r ≥ 4) has a spanning Eulerian subgraph whose degrees lie in the set {2,4,6}; also reduces the edge-connectivity needed for some theorems due to Barát and Gerbner (2014) and... 

In this paper. 11This article is a revised version of Daneshgar and Hajiabolhassan (2008) [19] distributed on arXiv.org (1'st, Jan. 2008). we consider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the nth mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set of n disjoint subsets of the vertex set of the graph. We show that the second mean isoperimetric constant in this general setting, coincides with (the mean version of) the classical Cheeger constant of the graph, while for the rest of the spectrum we show that there is a fundamental difference between the nth isoperimetric constant and... 

Let G be a graph with vertex set (Formula presented.) and (Formula presented.) be an (Formula presented.) matrix whose (Formula presented.) -entry is the maximum number of internally edge-disjoint paths between (Formula presented.) and (Formula presented.), if (Formula presented.), and zero otherwise. Also, define (Formula presented.), where D is a diagonal matrix whose i-th diagonal element is the number of edge-disjoint cycles containing (Formula presented.), whose (Formula presented.) is a multiple of J−I. Among other results, we determine the spectrum and the energy of the matrix (Formula presented.) for an arbitrary bicyclic graph G. © 2020 Informa UK Limited, trading as Taylor &... 

In this paper, first we introduce the concept of a connected graph homomorphism as a homomorphism for which the inverse image of any edge is either empty or a connected graph, and then we concentrate on chromatically connected (resp. chromatically disconnected) graphs such as G for which any χ(G)-colouring is a connected (resp. disconnected) homomorphism to K χ(G). In this regard, we consider the relationships of the new concept to some other notions as uniquely-colourability. Also, we specify some classes of chromatically disconnected graphs such as Kneser graphs KG(m, n) for which m is sufficiently larger than n, and the line graphs of non-complete class II graphs. Moreover, we prove that... 

Let G be a graph with vertex set (Formula presented.) and (Formula presented.) be an (Formula presented.) matrix whose (Formula presented.) -entry is the maximum number of internally edge-disjoint paths between (Formula presented.) and (Formula presented.), if (Formula presented.), and zero otherwise. Also, define (Formula presented.), where D is a diagonal matrix whose i-th diagonal element is the number of edge-disjoint cycles containing (Formula presented.), whose (Formula presented.) is a multiple of J−I. Among other results, we determine the spectrum and the energy of the matrix (Formula presented.) for an arbitrary bicyclic graph G. © 2020 Informa UK Limited, trading as Taylor &... 

We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common distribution in an i.i.d. manner. In a wireless network with n nodes, a simple one-hop scheme achieving the throughput scaling of order n 1/3-δ, for any arbitrarily small δ > 0, is proposed. This scheme is based on maximizing the number of successful concurrent transmissions. Such achievable throughput, along with the order n 1/3 upper bound derived by Cui et al., characterizes the throughput of one-hop schemes for the class of connection models with distribution having finite mean and variance  

It has been realized that the raft (mat) foundations are capable of bearing very large loads when they are assisted with a pile group. The contribution of both raft and piles to carry the surcharge loads is taken into account, considering the stiffness and strength of involved elements in the system, i.e. piles, raft and surrounding soil. The piles are usually required not to ensure the overall stability of the foundation but to act as settlement reducers. There is an alternative design in which, the piles are nonconnected from the raft to reduce the settlement, which are then known to be "settlement reducer non-connected piles" to increase the system stiffness. In this paper, two and three... 

A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S.The total domination number γ<(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sdγt(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the total domination number. We show that sdγt(G) ≤ n - γt(G) + 1 for any graph G of order n ≥ 3 and that sdγt(G) < n-γt(G) except if G ≃ P3, C3, K4, P6 or C6  

A new beam-to-column and bracing-to-frame connection that can tolerate high rotational and shear overload is described. The connection is a self-contained separate entity that comprises two parallel attachment plates between which two circular tubes are laid and fixed through welding. The whole combination can also be produced by extrusion, where the plates are laid in an orthogonal relation with the axis of bending. In the welded version, the two plates are laid in a parallel relation with the axis of bending  

A new general semi-rigid beam-to-column connection for skeletal structures, also applicable to offshore platforms, was devised. In a previous paper (OMAE02-28264), the general features of this joint together with some proposed details for its use in fabricating new platforms, as well as retrofitting and repair of existing platforms, were introduced. Moreover, the results of some quasi-static tests on the 'original' version of the connection, in which the energy-dissipating elements (tubes) of the connection are laid in a parallel relation to the axis of bending, were reported. Here, in this paper, the results of recent experimental work on the 'alternate' version of the connection, in which... 

An analytical method is presented that can be used to determine the behavior of a particular steel beam-to-column top and seat angle connection with double web angles. This article demonstrates a closed form solution of the equations of deformation, for this type of connection. Besides, a step-by-step analytical procedure for establishment of the linear part of M-θ curve of this form of connection is developed. However, this technique can properly be extended to the non-linear regions, which is not considered in this article. The correctness of the results has been ascertained by a comparison, using experimental approach as well as different analytical technique; and very good agreement has...