995 resultados para Dependence graphs
Resumo:
From the available H I data on spiral galaxies in three rich Abell clusters and the Virgo Cluster, it is shown that galaxies with medium to large optical sizes tend to be more severely deficient in atomic hydrogen than the small galaxies. This is so both in terms of the fractional number of galaxies that are deficient and the amount of gas lost by a galaxy. The fraction of H I-deficient galaxies increases with size over most of the size range, saturating or dropping only for the largest galaxies. A comparative study is made of various currently accepted gas removal mechanisms, namely those which are a result of galaxy-intracluster medium interactions, e.g., ram pressure stripping, as well as those due to galaxy-galaxy interactions, i.e., collisions and tidal interactions. It is shown that, with the exception of tidal interactions, all of these mechanisms would produce a size dependence in H I deficiency that is the opposite of that observed. That is, the gas in the largest galaxies would be the least affected by these mechanisms. However, if there is significant mass segregation, these processes may give the trends observed in the size dependence of H I deficiency.
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:
Structure and superconducting properties of Tl1?yPbyY1?xCaxSr2Cu2O7 (y=0.0, 0.1, 0.25 and 0.5) , derived from the parent insulator TlYSr2Cu2O7, have been investigated for different values of x. XANES studies show Pb to be in the 4+ state while Tl is in the 3+ state, suggesting thereby that in this series, (x?y) approximately corresponds to the hole concentration. The in-plane Cu---O distance decreases with increase in x for all values of y. The apical Cu---O distance as well as the Tl(Pb)---O(2) distance show anomalies at x=0.5 in the series with y=0.25; at this composition, Tc also reaches a maximum. In general, the composition (value of x) at which the Tc of Tl1?yPbyY1?xCaxSr2Cu2O7 reaches a maximum depends on the Pb content and the maximum Tc itself increases with increase in y, reaching a value of 105 K at y=0.5. More interestingly, a maximum Tc occurs at an (x?y) value of not, vert, similar0.25, which is close to the hole concentration at maximum Tc in other cuprate superconductors containing two CuO2 layers.
Resumo:
Theoretical calculations of the geminal carbonyl-13C- proton coupling constant, 2J(C′H), in α-amino acids have been carried out using Dirac Vector model and Penney-Dirac bond order formulations. The results indicate that the couplings are dependent on the backbone torsion angle psi (ψ) of the amino acid residues in peptides. The meagre available experimental data seem to support the theoretical findings.
Resumo:
Molecular dynamics calculations on methane sorbed in NaY (Si/Al = 3.0) employing realistic methane-methane and methane-zeolite intermolecular potential functions at different temperatures (50, 150, 220, and 300 K) and concentrations (2, 4, 6, and 8 molecules/cage) are reported. The thermodynamic results are in agreement with the available experimental data. Guest-guest and guest-host radial distribution functions (rdfs), energy distribution functions, distribution of cage occupancy, center-of-cage-center-of-mass (coc-com) rdfs, velocity autocorrelation functions for com and angular motion and the Fourier transformed power spectra, and diffusion coefficients are presented as a function of temperature and concentration. At 50 K, methane is localized near the adsorption site. Site-site migration and essentially free rotational motion are observed at 150 K. Molecules preferentially occupy the region near the inner surface of the alpha-cage. The vibrational frequencies for the com of methane shift toward higher values with decreasing temperature and increasing adsorbate concentration. The observed frequencies for com motion are 36, 53, and 85 cm-1 and for rotational motion at 50 K, 95 and 150 cm-1 in agreement with neutron scattering data. The diffusion coefficients show a type I behavior as a function of loading in agreement with NMR measurements. Cage-to-cage diffusion is found to be always mediated by the surface.
Resumo:
Pressure and temperature dependence of 35Cl nuclear quadrupole resonance (NQR) has been investigated in NaClO3 and Ba(ClO3)2·H2O. NQR frequencies are measured in the temperature range 77–300 K and up to 5 kbar pressure. The torsional frequency of the ClO3 pyramid and its variation with both pressure and temperature are evaluated from the NQR frequencies under the harmonic approximation. In general, the pressure effect on the internal motions is found to be less in Ba (ClO3)2·H2O compared to NaClO3. When the samples are cooled to 77 K the pressure coeffecient of NQR frequency becomes nearly zero in sodium chlorate, whereas it retains a value of 6 kHz kbar−1 in barium chlorate. This behaviour follows from the fact that at 77K, the torsional frequency in NaClO3 is unaffected by the application of pressure while it increases at the rate 12 cm−1 kbar−1 in Ba(ClO3)2·H2O.
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:
A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.
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:
The electrical resistance is measured in two binary liquid systems CS2 + CH3NO2 and n-C7H16 + CH3OH in the critical region as a function of frequency from 10 Hz to 100 kHz. The critical exponent b ≈ 0.35 in the singularity of dR/dT α (T - Tc)−b near Tc has no appreciable dependence upon the frequency. Thus any contribution from dielectric dispersion to the critical resistivity is not appreciable. The universal behaviour of the dR/dT anomaly does not seem to be followed in binary liquid systems.
Resumo:
The formation of anomalous indentations, with two opposite faces describing a pin-cushion effect and the other two faces normal, in long elongated grains of an extruded Mg-2Al-1Zn alloy is reported. Subsurface microstructural observations combined with Schmid factor calculations suggest that extension twinning accompanied by basal slip are the reasons for these. Johnson's expanding cavity model is invoked for further substantiation. (C) 2010 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.
Resumo:
The development of crystallographic texture and the change in the grain size during warm rolling (300 deg K) and their effect on the tensile yield strength at 77 and 300 deg K are studied in 99.9% pure Cd. Both longitudinal and transverse specimens are tested. The yield strength obeys the Hall--Petch relation. The Hall--Petch slope, k, is lower and the intercept sigma o is higher in the warm worked material in comparison with the corresponding values for annealed Cd. The differences are attributed to the change in 1013 < and 0001 textures that are developed during warm rolling.26 refs.--AA