Spectral characterization of families of split graphs

An upper bound for the sum of the squares of the entries of the principal eigenvector corresponding to a vertex subset inducing a k-regular subgraph is introduced and applied to the determination of an upper bound on the order of such induced subgraphs. Furthermore, for some connected graphs we establish a lower bound for the sum of squares of the entries of the principal eigenvector corresponding to the vertices of an independent set. Moreover, a spectral characterization of families of split graphs, involving its index and the entries of the principal eigenvector corresponding to the vertices of the maximum independent set is given. In particular, the complete split graph case is highlighted.

Spectra of graphs obtained by a generalization of the join graph operation

Taking a Fiedler’s result on the spectrum of a matrix formed from two symmetric matrices as a motivation, a more general result is deduced and applied to the determination of adjacency and Laplacian spectra of graphs obtained by a generalized join graph operation on families of graphs (regular in the case of adjacency spectra and arbitrary in the case of Laplacian spectra). Some additional consequences are explored, namely regarding the largest eigenvalue and algebraic connectivity.

Relations between (κ, τ)-regular sets and star complements

Let G be a finite graph with an eigenvalue μ of multiplicity m. A set X of m vertices in G is called a star set for μ in G if μ is not an eigenvalue of the star complement G\X which is the subgraph of G induced by vertices not in X. A vertex subset of a graph is (k ,t)-regular if it induces a k -regular subgraph and every vertex not in the subset has t neighbors in it. We investigate the graphs having a (k,t)-regular set which induces a star complement for some eigenvalue. A survey of known results is provided and new properties for these graphs are deduced. Several particular graphs where these properties stand out are presented as examples.

Acute electronic cigarette use: nicotine delivery and subjective effects in regular users

Rationale Electronic cigarettes are becoming increasingly popular among smokers worldwide. Commonly reported reasons for use include the following: to quit smoking, to avoid relapse, to reduce urge to smoke, or as a perceived lower-risk alternative to smoking. Few studies, however, have explored whether electronic cigarettes (e-cigarettes) deliver measurable levels of nicotine to the blood. Objective This study aims to explore in experienced users the effect of using an 18-mg/ml nicotine first-generation e-cigarette on blood nicotine, tobacco withdrawal symptoms, and urge to smoke. Methods Fourteen regular e-cigarette users (three females), who are abstinent from smoking and e-cigarette use for 12 h, each completed a 2.5 h testing session. Blood was sampled, and questionnaires were completed (tobacco-related withdrawal symptoms, urge to smoke, positive and negative subjective effects) at four stages: baseline, 10 puffs, 60 min of ad lib use and a 60-min rest period. Results Complete sets of blood were obtained from seven participants. Plasma nicotine concentration rose significantly from a mean of 0.74 ng/ml at baseline to 6.77 ng/ml 10 min after 10 puffs, reaching a mean maximum of 13.91 ng/ml by the end of the ad lib puffing period. Tobacco-related withdrawal symptoms and urge to smoke were significantly reduced; direct positive effects were strongly endorsed, and there was very low reporting of adverse effects. Conclusions These findings demonstrate reliable blood nicotine delivery after the acute use of this brand/model of e-cigarette in a sample of regular users. Future studies might usefully quantify nicotine delivery in relation to inhalation technique and the relationship with successful smoking cessation/harm reduction.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

Betweenness Centrality in Some Classes of Graphs

There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness centrality is a measure of the influence of a vertex over the flow of information between every pair of vertices under the assumption that information primarily flows over the shortest path between them. In this paper we present betweenness centrality of some important classes of graphs.

On the difficulties of present theoretical models to predict the oxidation state of atomic Au adsorbed on regular sites of CeO2(111)

The electronic structure and oxidation state of atomic Au adsorbed on a perfect CeO2(111) surface have been investigated in detail by means of periodic density functional theory-based calculations, using the LDA+U and GGA+U potentials for a broad range of U values, complemented with calculations employing the HSE06 hybrid functional. In addition, the effects of the lattice parameter a0 and of the starting point for the geometry optimization have also been analyzed. From the present results we suggest that the oxidation state of single Au atoms on CeO2(111) predicted by LDA+U, GGA+U, and HSE06 density functional calculations is not conclusive and that the final picture strongly depends on the method chosen and on the construction of the surface model. In some cases we have been able to locate two well-defined states which are close in energy but with very different electronic structure and local geometries, one with Au fully oxidized and one with neutral Au. The energy difference between the two states is typically within the limits of the accuracy of the present exchange-correlation potentials, and therefore, a clear lowest-energy state cannot be identified. These results suggest the possibility of a dynamic distribution of Au0 and Au+ atomic species at the regular sites of the CeO2(111) surface.

Spatial and temporal variability of the concentration field from localized releases in a regular building array

Spatial and temporal fluctuations in the concentration field from an ensemble of continuous point-source releases in a regular building array are analyzed from data generated by direct numerical simulations. The release is of a passive scalar under conditions of neutral stability. Results are related to the underlying flow structure by contrasting data for an imposed wind direction of 0 deg and 45 deg relative to the buildings. Furthermore, the effects of distance from the source and vicinity to the plume centreline on the spatial and temporal variability are documented. The general picture that emerges is that this particular geometry splits the flow domain into segments (e.g. “streets” and “intersections”) in each of which the air is, to a first approximation, well mixed. Notable exceptions to this general rule include regions close to the source, near the plume edge, and in unobstructed channels when the flow is aligned. In the oblique (45 deg) case the strongly three-dimensional nature of the flow enhances mixing of a scalar within the canopy leading to reduced temporal and spatial concentration fluctuations within the plume core. These fluctuations are in general larger for the parallel flow (0 deg) case, especially so in the long unobstructed channels. Due to the more complex flow structure in the canyon-type streets behind buildings, fluctuations are lower than in the open channels, though still substantially larger than for oblique flow. These results are relevant to the formulation of simple models for dispersion in urban areas and to the quantification of the uncertainties in their predictions.

On the variations of the Betti numbers of regular levels of Morse flows

We generalize results in Cruz and de Rezende (1999) [7] by completely describing how the Beth numbers of the boundary of an orientable manifold vary after attaching a handle, when the homology coefficients are in Z, Q, R or Z/pZ with p prime. First we apply this result to the Conley index theory of Lyapunov graphs. Next we consider the Ogasa invariant associated with handle decompositions of manifolds. We make use of the above results in order to obtain upper bounds for the Ogasa invariant of product manifolds. (C) 2011 Elsevier B.V. All rights reserved.

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is Sigma(k)(i=1) vertical bar C(i)vertical bar. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M, find a minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width. (C) 2008 Elsevier B.V. All rights reserved.

Theory of strongly correlated electron systems. I. Intersite coulomb interaction and the approximation of renormalized fermions in total energy calculations

The diagrammatic strong-coupling perturbation theory (SCPT) for correlated electron systems is developed for intersite Coulomb interaction and for a nonorthogonal basis set. The construction is based on iterations of exact closed equations for many - electron Green functions (GFs) for Hubbard operators in terms of functional derivatives with respect to external sources. The graphs, which do not contain the contributions from the fluctuations of the local population numbers of the ion states, play a special role: a one-to-one correspondence is found between the subset of such graphs for the many - electron GFs and the complete set of Feynman graphs of weak-coupling perturbation theory (WCPT) for single-electron GFs. This fact is used for formulation of the approximation of renormalized Fermions (ARF) in which the many-electron quasi-particles behave analogously to normal Fermions. Then, by analyzing: (a) Sham's equation, which connects the self-energy and the exchange- correlation potential in density functional theory (DFT); and (b) the Galitskii and Migdal expressions for the total energy, written within WCPT and within ARF SCPT, a way we suggest a method to improve the description of the systems with correlated electrons within the local density approximation (LDA) to DFT. The formulation, in terms of renormalized Fermions LIDA (RF LDA), is obtained by introducing the spectral weights of the many electron GFs into the definitions of the charge density, the overlap matrices, effective mixing and hopping matrix elements, into existing electronic structure codes, whereas the weights themselves have to be found from an additional set of equations. Compared with LDA+U and self-interaction correction (SIC) methods, RF LDA has the advantage of taking into account the transfer of spectral weights, and, when formulated in terms of GFs, also allows for consideration of excitations and nonzero temperature. Going beyond the ARF SCPT, as well as RF LIDA, and taking into account the fluctuations of ion population numbers would require writing completely new codes for ab initio calculations. The application of RF LDA for ab initio band structure calculations for rare earth metals is presented in part 11 of this study (this issue). (c) 2005 Wiley Periodicals, Inc.

Quasi-Regular Solutions for 3D Equations of Tricomi and Keldish Types

Цветан Д. Христов, Недю Ив. Попиванов, Манфред Шнайдер - Изучени са някои тримерни гранични задачи за уравнения от смесен тип. За уравнения от типа на Трикоми те са формулирани от М. Протер през 1952, като тримерни аналози на задачите на Дарбу или Коши–Гурса в равнината. Добре известно е, че новите задачи са некоректни. Ние формулираме нова гранична задача за уравнения от типа на Келдиш и даваме понятие за квазиругулярно решение на тази задача и на eдна от задачите на Протер. Намерени са достатъчни условия за единственост на такива решения.

Bethe graphs attached to the vertices of a connected graph: a spectral approach

A weighted Bethe graph $B$ is obtained from a weighted generalized Bethe tree by identifying each set of children with the vertices of a graph belonging to a family $F$ of graphs. The operation of identifying the root vertex of each of $r$ weighted Bethe graphs to the vertices of a connected graph $\mathcal{R}$ of order $r$ is introduced as the $\mathcal{R}$-concatenation of a family of $r$ weighted Bethe graphs. It is shown that the Laplacian eigenvalues (when $F$ has arbitrary graphs) as well as the signless Laplacian and adjacency eigenvalues (when the graphs in $F$ are all regular) of the $\mathcal{R}$-concatenation of a family of weighted Bethe graphs can be computed (in a unified way) using the stable and low computational cost methods available for the determination of the eigenvalues of symmetric tridiagonal matrices. Unlike the previous results already obtained on this topic, the more general context of families of distinct weighted Bethe graphs is herein considered.