168 resultados para Equienergetic self-complementary graphs
Resumo:
Let n points be placed independently in d-dimensional space according to the density f(x) = A(d)e(-lambda parallel to x parallel to alpha), lambda, alpha > 0, x is an element of R-d, d >= 2. Let d(n) be the longest edge length of the nearest-neighbor graph on these points. We show that (lambda(-1) log n)(1-1/alpha) d(n) - b(n) converges weakly to the Gumbel distribution, where b(n) similar to ((d - 1)/lambda alpha) log log n. We also prove the following strong law for the normalized nearest-neighbor distance (d) over tilde (n) = (lambda(-1) log n)(1-1/alpha) d(n)/log log n: (d - 1)/alpha lambda <= lim inf(n ->infinity) (d) over tilde (n) <= lim sup(n ->infinity) (d) over tilde (n) <= d/alpha lambda almost surely. Thus, the exponential rate of decay alpha = 1 is critical, in the sense that, for alpha > 1, d(n) -> 0, whereas, for alpha <= 1, d(n) -> infinity almost surely as n -> infinity.
Resumo:
A spanning tree T of a graph G is said to be a tree t-spanner if the distance between any two vertices in T is at most t times their distance in G. A graph that has a tree t-spanner is called a tree t-spanner admissible graph. The problem of deciding whether a graph is tree t-spanner admissible is NP-complete for any fixed t >= 4 and is linearly solvable for t <= 2. The case t = 3 still remains open. A chordal graph is called a 2-sep chordal graph if all of its minimal a - b vertex separators for every pair of non-adjacent vertices a and b are of size two. It is known that not all 2-sep chordal graphs admit tree 3-spanners This paper presents a structural characterization and a linear time recognition algorithm of tree 3-spanner admissible 2-sep chordal graphs. Finally, a linear time algorithm to construct a tree 3-spanner of a tree 3-spanner admissible 2-sep chordal graph is proposed. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010
Resumo:
We propose a new self-assembly based strategy for the design of novel lanthanide based luminescent materials. In this approach a europium hydrogel is prepared and sensitization is achieved by doping the gel with pyrene in a non-coordinated fashion.
Resumo:
Background. Several types of networks, such as transcriptional, metabolic or protein-protein interaction networks of various organisms have been constructed, that have provided a variety of insights into metabolism and regulation. Here, we seek to exploit the reaction-based networks of three organisms for comparative genomics. We use concepts from spectral graph theory to systematically determine how differences in basic metabolism of organisms are reflected at the systems level and in the overall topological structures of their metabolic networks. Methodology/Principal Findings. Metabolome-based reaction networks of Mycobacterium tuberculosis, Mycobacterium leprae and Escherichia coli have been constructed based on the KEGG LIGAND database, followed by graph spectral analysis of the network to identify hubs as well as the sub-clustering of reactions. The shortest and alternate paths in the reaction networks have also been examined. Sub-cluster profiling demonstrates that reactions of the mycolic acid pathway in mycobacteria form a tightly connected sub-cluster. Identification of hubs reveals reactions involving glutamate to be central to mycobacterial metabolism, and pyruvate to be at the centre of the E. coli metabolome. The analysis of shortest paths between reactions has revealed several paths that are shorter than well established pathways. Conclusions. We conclude that severe downsizing of the leprae genome has not significantly altered the global structure of its reaction network but has reduced the total number of alternate paths between its reactions while keeping the shortest paths between them intact. The hubs in the mycobacterial networks that are absent in the human metabolome can be explored as potential drug targets. This work demonstrates the usefulness of constructing metabolome based networks of organisms and the feasibility of their analyses through graph spectral methods. The insights obtained from such studies provide a broad overview of the similarities and differences between organisms, taking comparative genomics studies to a higher dimension.
Resumo:
Any pair of non-adjacent vertices forms a non-edge in a graph. Contraction of a non-edge merges two non-adjacent vertices into a single vertex such that the edges incident on the non-adjacent vertices are now incident on the merged vertex. In this paper, we consider simple connected graphs, hence parallel edges are removed after contraction. The minimum number of nodes whose removal disconnects the graph is the connectivity of the graph. We say a graph is k-connected, if its connectivity is k. A non-edge in a k-connected graph is contractible if its contraction does not result in a graph of lower connectivity. Otherwise the non-edge is non-contractible. We focus our study on non-contractible non-edges in 2-connected graphs. We show that cycles are the only 2-connected graphs in which every non-edge is non-contractible. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Coordination-driven self-assembly of 1,3,5-benzenetricarboxylate (tma; 1) and oxalato-bridged p-cymeneruthenium(II) building block Ru-2(mu-eta(4)-C2O4)(MeOH)(2)(eta(6)-p-cymene)(2)](O3SCF3)(2) (2) affords an unusual octanuclear incomplete prism Ru-8(eta(6)-p-cymene)(8)(tma)(2)(mu-eta(4)-C2O4)(2)(OMe)(4)](O3SCF3)( 2) (3), which exhibits a remarkable shape-selective binding affinity for neutral phenolic compounds via hydrogen-bonding interactions (p-cymene = p-(PrC6H4Me)-Pr-i). Such a binding was confirmed by single-crystal X-ray diffraction analysis using 1,3,5-trihydroxybenzene as an analyte.
Resumo:
A first comprehensive investigation on the deflagration of ammonium perchlorate (AP) in the subcritical regime, below the low pressure deflagration limit (LPL, 2.03 MPa) christened as regime I$^{\prime}$, is discussed by using an elegant thermodynamic approach. In this regime, deflagration was effected by augmenting the initial temperature (T$_{0}$) of the AP strand and by adding fuels like aliphatic dicarboxylic acids or polymers like carboxy terminated polybutadiene (CTPB). From this thermodynamic model, considering the dependence of burning rate ($\dot{r}$) on pressure (P) and T$_{0}$, the true condensed (E$_{\text{s,c}}$) and gas phase (E$_{\text{s,g}}$) activation energies, just below and above the surface respectively, have been obtained and the data clearly distinguishes the deflagration mechanisms in regime I$^{\prime}$ and I (2.03-6.08 MPa). Substantial reduction in the E$_{\text{s,c}}$ of regime I$^{\prime}$, compared to that of regime I, is attributed to HClO$_{4}$ catalysed decomposition of AP. HClO$_{4}$ formation, which occurs only in regime I$^{\prime}$, promotes dent formation on the surface as revealed by the reflectance photomicrographs, in contrast to the smooth surface in regime I. The HClO$_{4}$ vapours, in regime I$^{\prime}$, also catalyse the gas phase reactions and thus bring down the E$_{\text{s,g}}$ too. The excess heat transferred on to the surface from the gas phase is used to melt AP and hence E$_{\text{s,c}}$, in regime I, corresponds to the melt AP decomposition. It is consistent with the similar variation observed for both the melt layer thickness and $\dot{r}$ as a function of P. Thermochemical calculations of the surface heat release support the thermodynamic model and reveal that the AP sublimation reduces the required critical exothermicity of 1108.8 kJ kg$^{-1}$ at the surface. It accounts for the AP not sustaining combustion in the subcritical regime I$^{\prime}$. Further support for the model comes from the temperature-time profiles of the combustion train of AP. The gas and condensed phase enthalpies, derived from the profile, give excellent agreement with those computed thermochemically. The $\sigma _{\text{p}}$ expressions derived from this model establish the mechanistic distinction of regime I$^{\prime}$ and I and thus lend support to the thermodynamic model. On comparing the deflagration of strand against powder AP, the proposed thermodynamic model correctly predicts that the total enthalpy of the condensed and gas phases remains unaltered. However, 16% of AP particles undergo buoyant lifting into the gas phase in the `free board region' (FBR) and this renders the demarcation of the true surface difficult. It is found that T$_{\text{s}}$ lies in the FBR and due to this, in regime I$^{\prime}$, the E$_{\text{s,c}}$ of powder AP matches with the E$_{\text{s,g}}$ of the pellet. The model was extended to AP/dicarboxylic acids and AP/CTPB mixture. The condensed ($\Delta $H$_{1}$) and gas phase ($\Delta $H$_{2}$) enthalpies were obtained from the temperature profile analyses which fit well with those computed thermochemically. The $\Delta $H$_{1}$ of the AP/succinic acid mixture was found just at the threshold of sustaining combustion. Indeed the lower homologue malonic acid, as predicted, does not sustain combustion. In vaporizable fuels like sebacic acid the E$_{\text{s,c}}$ in regime I$^{\prime}$, understandably, conforms to the AP decomposition. However, the E$_{\text{s,c}}$ in AP/CTPB system corresponds to the softening of the polymer which covers AP particles to promote extensive condensed phase reactions. The proposed thermodynamic model also satisfactorily explains certain unique features like intermittent, plateau and flameless combustion in AP/ polymeric fuel systems.
Resumo:
A novel universal approach to understand the self-deflagration in solids has been attempted by using basic thermodynamic equation of partial differentiation, where burning mte depends on the initial temperature and pressure of the system. Self-deflagrating solids are rare and are reported only in few compounds like ammonium perchlorate (AP), polystyrene peroxide and tetrazole. This approach has led us to understand the unique characteristics of AP, viz. the existence of low pressure deflagration limit (LPL 20 atm), hitherto not understood sufficiently. This analysis infers that the overall surface activation energy comprises of two components governed by the condensed phase and gas phase processes. The most attractive feature of the model is the identification of a new subcritical regime I' below LPL where AP does not burn. The model is aptly supported by the thermochemical computations and temperature-profile analyses of the combustion train. The thermodynamic model is further corroborated from the kinetic analysis of the high pressure (1-30 atm) DTA thermograms which affords distinct empirical decomposition rate laws in regimes I' and 1 (20-60 atm). Using Fourier-Kirchoff one dimensional heat transfer differential equation, the phase transition thickness and the melt-layer thickness have been computed which conform to the experimental data.
Resumo:
This study explores the utility of polarimetric measurements for discriminating between hydrometeor types with the emphasis on (a) hail detection and discrimination of its size, (b) measurement of heavy precipitation, (c) identification and quantification of mixed-phase hydrometeors, and (d) discrimination of ice forms. In particular, we examine the specific differential phase, the backscatter differential phase, the correlation coefficient between vertically and horizontally polarized waves, and the differential reflectivity, collected from a storm at close range. Three range–height cross sections are analyzed together with complementary data from a prototype WSR-88D radar. The case is interesting because it demonstrates the complementary nature of these polarimetric measurands. Self-consistency among them allows qualitative and some quantitative discrimination between hydrometeors.
Resumo:
The role of self accomodation of the different mertensite variants controlling the morphologies of the Zr---2.5wt%Nb alloy martensite has been examined. Three distinct types of grouping of martensite variants have been found to be predominantly present. Crystallographic descriptions of these groups have been provided and the degrees of self accomodation for these have been estimated and compared with those corresponding to other possible variant groupings around the symmetry axes of the parent phase. The frequently observed 3-variant group, which shows an “indentation mark” morphology when viewed along left angle bracket111right-pointing angle bracketβ directions in the transmission electron microscope, has been seen to have the highest degree of self accomodation amongst the cases considered. Based on the observations made, a growth sequence leading to the formation of the final martensitic structure has been proposed.
Resumo:
An organic-inorganic composite material is obtained by self-assembly of 2,3-didecyloxy-anthracene (DDOA), an organogelator of butanol, and organic-capped ZnO nanoparticles (NPs). The ligand 3, 2,3-di(6-oxy-n-hexanoic acid)-anthracene, designed to cap ZnO and interact with the DDOA nanofibers by structural similarity, improves the dispersion of the NPs into the organogel. The composite material displays mechanical properties similar to those of the pristine DDOA organogel, but gelates at a lower critical concentration and emits significantly less, even in the presence of very small amounts of ZnO NPs. The ligand 3 could also act as a relay to promote the photo-induced quenching process.
Resumo:
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.