Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002     

T-型树谱唯一性的一个简单刻画

图G称为谱唯一的,如果任何与G谱相同的图一定与G同构.一棵树称为T-型树如果其仅有一个最大度为3的顶点.本文给出了T-型树谱唯一性的一个简单刻画,从而完全解决了T-型树的谱唯一性问题.     

Signed graphs for portfolio analysis in risk management

We introduce the notion of structural balance for signed graphsin the context of portfolio analysis. A portfolio of securitiescan be represented as a signed graph with the nodes denotingthe securities and the edges representing the correlation betweenthe securities. With signed graphs, the characteristics of aportfolio from a risk management perspective can be uncoveredfor analysis purposes. It is shown that a portfolio characterizedby a signed graph of positive and negative edges that is structurallybalanced is characteristically more predictable. Investors whoundertake a portfolio position with all positively correlatedsecurities do so with the intention to speculate on the upside(or downside). If the portfolio consists of negative edges andis balanced, then it is likely that the position has a hedgingdisposition within it. On the other hand, an unbalanced signedgraph is representative of an investment portfolio which ischaracteristically unpredictable.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

A new approach to obtain the non-Condon factors in closed form for two one-dimensional harmonic oscillators

A simple algebraic approach to calculate general Franck-Condon overlaps is extended to evaluate non-Condon factors for two one-dimensional harmonic oscillators. The method is based on the use of eigenstates of the harmonic oscillator annihilation operator which allows to obtain in terms of a multi-dimensional Hermite polynomial the overlap of harmonic oscillator functions associated with different Born-Oppenheimer potentials. The presented approach is self-contained, only basic concepts of quantum mechanics associated with the harmonic oscillator system are needed. The obtained expression for the Franck-Condon overlaps is similar to the Ansbacher’s formula and equivalent to the one calculated by Malkin and Man’ko. However our final expression has the advantages that only real numbers are involved and it is straightforward to get the limit case of equal frequencies. Concerning the non-Condon factors two approaches leading to different formulas are considered, both of which reduce to triple sums of products of three Hermite polynomials.     

Nonextensive Statistical Mechanics Application to Vibrational Dynamics of Protein Folding

The vibrational dynamics of protein folding is analyzed in the framework of Tsallis statistics. We employ exact expressions for classical harmonic oscillators by considering the unnormalized constraints. As q→1, we show that these approximations agree with the result of Gaussian network model.     

A characterization of projective-planar signed graphs

A signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative depending on whether it contains an even or odd number of negative edges, respectively. We consider embeddings of a signed graph in the projective plane for which a simple cycle is essential if and only if it is negative. We characterize those signed graphs that have such a projective-planar embedding. Our characterization is in terms of a related signed graph formed by considering the theta subgraphs in the given graph.     

Subgroup separability of graphs of abelian groups

In the present paper we give necessary and sufficient conditions for the subgroup separability of the fundamental group of a finite graph of groups with finitely generated abelian vertex groups.

     

SINGULAR BOUNDARY PROPERTIES OF HARMONIC FUNCTIONS AND FRACTAL ANALYSIS

ＳＩＮＧＵＬＡＲＢＯＵＮＤＡＲＹＰＲＯＰＥＲＴＩＥＳＯＦＨＡＲＭＯＮＩＣＦＵＮＣＴＩＯＮＳＡＮＤＦＲＡＣＴＡＬＡＮＡＬＹＳＩＳＷＥＮＺＨＩＹＩＮＧＺＨＡＮＧＹＩＰＩＮＧＭａｎｕｓｃｒｉｐｔｒｅｃｅｉｖｅｄＪａｎｕａｒｙ１１，１９９５．Ｒｅｖｉ...     

On the chromatic polynomial of a graph

Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()^α≤≤ () ^{n −ω}. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour number μ(G) of G: n− (n−ω)() ^{n −ω}≤μ(G)≤n−α() ^α. Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002