bluuebunny/crossref_metadata_2025_split huggingface dataset:
Statistical inference for atmospheric transport models using process convolutions
Authors: Zhou Weining , Sansó Bruno 
Published: June 2007

AbstractA computer simulator for atmospheric concentrations of chemical species, or chemical transport model, is used to simulate global ozone concentrations. Two different wind forcings are considered: one is a combination of a numerical weather prediction model and observational data, the other is obtained as output from a climate model. The goal is to study the impact of meteorological variability on ozone. The statistical approach that we consider consists on learning the spatial structure of ozone concentrations by using process convolutions. We use several Bayesian model comparison methods to determine if the two simulations can be considered as realizations of the same random field. The methods provide a quantification of the differences for each of the computer model grid cells. Copyright © 2007 John Wiley & Sons, Ltd.
Implications of neuropsychological test results of women in a new phase of anorexia nervosa
Authors: Thompson Simon B. N. 
Published: June 2007

AbstractA study involving 10 female anorectics who satisfied DSM‐III‐R (American Psychiatric Association, 1987) criteria in a new phase of outpatient treatment and 10 healthy female controls matched for age, education, social class, premorbid IQ and geographical habitation, were administered a battery of well‐known neuropsychological tests and rating scales. Personal details concerning subjects' weight history and parents' occupations were also recorded.Significant evidence was found to suggest a difference between the anorectics and the controls on a number of tests and scales. In particular, anorectics performed worse on the third trial of the Auditory Verbal Learning Test and on the Rey‐Osterreith Complex Figure Test (Delayed Recall Trial) possibly implying impairment of the right hemisphere considered to be responsible, in part, for visuospatial ability. This was believed to be one of the reasons for distortion of body image in anorexia nervosa.Strong evidence was also found in support of the coexistence of obsessionality and depression in anorexia nervosa. Since there is growing evidence implicating the caudate nucleus for the obsessionality in obsessive‐compulsive disorder, it was proposed that this association might also be likely to explain the obsessionality in anorexia nervosa, thus supporting hypotheses that propose an organic origin for the condition.
Inpatient treatment for anorexia nervosa: A lenient approach
Authors: Grave Ricardo Dalle , Bartocci Claudia , Todisco Patrizia , Pantano Michela , Bosello Ottavio 
Published: June 2007

AbstractThis paper describes a lenient treatment for anorexia nervosa patients. The method incorporates nutritional rehabilitation, psychoeducational groups, parental psychoeducational groups, physiotherapy and individual psychotherapy (psychodynamically oriented). The model entails a multi‐level matching system where patients' needs are coordinated with the appropriate treatment setting. The three‐level system integrates: a hospital eating disorder unit; day care treatment as transition phase from inpatient to outpatient, and outpatient treatment. Patients shift between levels according to their progress. The therapeutic elements of the programme are presented in detail with results obtained from 44 patients.
Anaerobic exercise as an adjunct to refeeding patients with anorexia nervosa: Does it compromise weight gain?
Authors: Touyz Stephen W. , Lennerts Wolfgang , Arthur Brenden , Beumont Peter J. V. 
Published: June 2007

AbstractThe present study compared the rate of weight gain during refeeding in 39 patients with anorexia nervosa. Patients were allocated to two cohorts with one receiving a structured anaerobic exercise programme and the other not. A retrospective analysis of their records revealed that there was no significant difference in the rate of weight gain between the two groups. The clinical implications of this finding are encouraging as it suggests that the inclusion of a formalized exercise programme during refeeding may not necessarily adversely affect weight gain and may improve compliance. Exercise counselling in anorexia nervosa is an important but often neglected component of treatment.
Cytotoxicity evaluation of an antibacterial dentin adhesive system on established cell lines
Authors: Koulaouzidou Elizabeth A. , Helvatjoglu‐Antoniades Maria , Palaghias George , Karanika‐Kouma Artemis , Antoniades Dimitrios 
Published: June 2007

AbstractClearfil Protect Bond is a new dental bonding agent recently introduced into clinical practice. It contains an antibacterial monomer that contributes to its antibacterial profile. The aim of the present study was to evaluate cytotoxic effect of Clearfil Protect Bond against three established fibroblastic cell lines, in comparison with four commonly used adhesive materials (Adper Scotchbond 1, Excite, Tyrian SPE, and One Step plus). The experiments were performed using RPC‐C2A, BHK21/C13, and MRC5 cell lines. Test specimens, either cured or uncured, were placed in a culture medium and the extraction media were used as experimental material. The effect of the bonding materials was assessed by a modified sulforhodamine‐B assay after 24 and 48 h of exposure. All tested agents exhibited an antiproliferative effect on cells, the effect on RPC‐C2A being the most marked. Extraction media from the uncured materials were without exception highly cytotoxic. In the experiments performed using extraction medium from cured material, Clearfil Protect Bond appeared to be the least toxic material, followed by Tyrian SPE and One Step plus. Adper Scotchbond 1 and Excite exhibited the strongest cytotoxic effect. The cell survival percentage ranged between 66 and 97% for Clearfil Protect bond, 15 and 82% for Tyrian SPE, 28 and 58% for One Step plus, 2 and 28% for Excite, and 1 and 6% for Adper Scotchbond 1. Taking into consideration the limitations of anin vitrostudy, our results indicate that the new antibacterial dental adhesive system is suitable for clinical application. © 2007 Wiley Periodicals, Inc. J Biomed Mater Res Part B: Appl Biomater, 2008
Orientation embedding of signed graphs
Authors: Zaslavsky Thomas 
Published: June 2007

AbstractA signed graph Σ consists of a graph and a sign labeling of its edges. A polygon in Σ is “balanced” if its sign product is positiive. A signed graph is “orientatio embedded” in a surface if it is topologically embedded and a polygon is balanced precisely when traveling once around it preserves orientation. We explore the extension to orientation embedding of the ordinary theory of graph embedding. Let d(Σ) be the demigenus (= 2 ‐ x(S)) of the unique smallest surface S in which Σ has an orientation embedding. Our main results are an easy one, that if Σ has connected components Σ1, Σ[2], ⃛, then d(Σ) = d(Σ1) + ⃛, and a hard one, that if Σ has a cut vertex v that splits Σ into Σ1, Σ2, ⃛, then d(Σ) = d(Σ1) + d(Σ2) + ⃛ ‐δ, where δ depends on the number of Σi in which v is “loopable”, that is, in which d(Σi) = d(Σi with a negative loop added to v). This is as with ordinary orientable grpah embedidng except for the existence of the term δ in the cut‐vertex formula. Since loopability is crucial, we give some partial criteria for it. (A complete characterization seems difficult.) We conclude with an application to forbidden subgraphs and minors for orientation embeddability in a given surface. © 1929 John Wiley & Sons, Inc.
Chromatic polynomials, polygon trees, and outerplanar graphs
Authors: Wakelin C. D. , Woodall D. R. 
Published: June 2007

AbstractIt is proved that all classes of polygon trees are characterized by their chromatic polynomials, and a characterization is given of those polynominals that are chromatic polynomials of outerplanar graphs. The first result yields an alternative proof that outerplanar graphs are recognizable from their vertex‐deleted subgraphs. © 1929 John Wiley & Sons, Inc.
Subgraphs and well‐quasi‐ordering
Authors: Ding Guoli 
Published: June 2007

AbstractLet 𝒴 be a class of graphs and let ⪯ be the subgraph or the induced subgraph relation. We call ⪯ an ideal (with respect to ⪯) if ⪯ implies that ⪯. In this paper, we study the ideals that are well‐quasiordered by ⪯. The following are our main results. If ⪯ is the subgraph relation, we characterize the well‐quasi‐ordered ideals in terms of exluding subgraphs. If⪯is the induced subgraph relation, we present three wellquasi‐ordered ideals. We also construct examples to disprove some of the possible generalizations of our results. The connections between some of our results and digraphs are considered in this paper too.
Nearly uniform distribution of edges among k‐subgraphs of a graph
Authors: Širáň Jozef , Tuza Zsolt 
Published: June 2007

AbstractWe investigate the behavior of the function f = f(n, k, e) defined as the smallest integer with the following property: If in a graph on n vertices, the numbers of edges in any two induced subgraphs on k vertices differ by at most e, then the graph or its complement has at most f edges. One of the results states that

. © 1929 John Wiley & Sons, Inc.
Cubic graphs with 62 vertices having the same path layer matrix
Authors: Dobrynin A. A. 
Published: June 2007

AbstractThe path layer matrix (or path degree sequence) of a graph G contains quantitative information about all paths in G. The entry (i,j) in this matrix is the number of simple paths in G having initial vertex v and length j. It was known that there are cubic graphs on 90 vertices having the same path layer matrix (Dobrynin, 1990). A new upper bound for the least order of cubic graphs with the same path layer matrix is presented. © 1993 John Wiley & Sons, Inc.
Edge‐chromatic critical graphs and the existence of 1‐factors
Authors: Choudum S. A. 
Published: June 2007

AbstractWe give examples of edge‐chromatic critical graphs G of the following types: (i) of even order and having no 1‐factor, and (ii) of odd order and having a vertex v of minimum degree such that G − v has no 1‐factor. The first disproves a conjecture of S. Fiorini and R. J. Wilson, and the second answers a question of A. G. Chetwynd and H. P. Yap in the negative. © 1993 John Wiley & Sons, Inc.
A note on the characterization of domination perfect graphs
Authors: Fulman Jason 
Published: June 2007

AbstractA graph G is domination perfect if for each induced subgraph H of G, γ(H) = i(H), where γ and i are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of domination perfect graphs. This characterization is not correct, but the ideas in [3] can be used to weaken the known sufficient conditions for a graph to be domination perfect and to obtain short proofs of some results regarding domination perfect graphs. © 1993 John Wiley & Sons, Inc.
Large P4‐free graphs with bounded degree
Authors: Chung Myung S. , West Douglas B. 
Published: June 2007

AbstractLet ex * (D; H) denote the maximum number of edges in a connected graph with maximum degree D and no induced subgraph isomorphic to H. We prove that this is finite only when H is a disjoint union of paths,m in which case we provide crude upper and lower bounds. When H is the four‐vertex path P4, we prove that the complete bipartite graph KD,D is the unique extremal graph. Furthermore, if G is a connected P4‐free graph with maximum degree D and clique number ω, then G has at most D2 − D(ω − 2)/2 edges. © 1993 John Wiley & Sons, Inc.
Extremal interval graphs
Authors: Eckhoff Jürgen 
Published: June 2007

AbstractAn interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for the numbers of such graphs. © 1993 John Wiley & Sons, Inc.
On the connectivity of graphs generated by a sum of random mappings
Authors: Jaworski Jerzy , Karoński Michał 
Published: June 2007

AbstractWe consider four models of random directed multigraphs with n labeled vertices of out‐degree d. First we establish formal relationships between our models with respect to exact and asymptotic (as n → ∞) probabilities of possessing a graph monotone property. We also study the asymptotic behavior of the strength of connectivity of the underlying simple graphs when d = o(n). © 1993 John Wiley & Sons, Inc.
Note on hypergraphs and sphere orders
Authors: Schrijver Alexander 
Published: June 2007

AbstractWe show that each partial order ≤ of height 2 can be represented by spheres in Euclidean space, where inclusion represents ≤. If each element has at most k elements under it, we can do this in 2k − 1‐dimensional space. This extends a result (and a method) of Scheinerman for the case k = 2. © 1993 John Wiley & Sons, Inc.
Supereulerian complementary graphs
Authors: Lai Hong‐Jian 
Published: June 2007

AbstractNebeský in [12] show that for any simple graph with n ≥ 5 vertices, either G or Gc contains an eulerian subgraph with order at least n ‐ 1, with an explicitly described class of exceptional graphs. In this note, we show that if G is a simple graph with n ≥ 61 vertices, then either G or Gc is supereulerian, with some exceptions. We also characterize all these exceptional cases. These results are applied to show that if G is a simple graph with n ≥ 61 vertices such that both G and Gc are connected, then either G or Gc has a 4‐flow, or both G and Gc have cut‐edges. © 1993 John Wiley & Sons, Inc.
Generalized Rotation numbers
Authors: Chapman Robin J. , Haviland Julie 
Published: June 2007

AbstractA rooted graph is a pair (G,x), where G is a simple undirected graph and x ∈ V(G). If G is rooted at x, its kth rotation number hk (G,x) is the minimum number of edges in a graph F of order |G| + k such that for every v ∈ V(F) we can find a copy of G in F with the root vertex x at v. When k = 0, this definition reduces to that of the rotation number h(G,x), which was introduced in [“On Rotation Numbers for Complete Bipartite Graphs,” University of Victoria, Department of Mathematics Report No. DM‐186‐IR (1979)] by E.J. Cockayne and P.J. Lorimer and subsequently calculated for complete multipartite graphs. In this paper, we estimate the kth rotation number for complete bipartite graphs G with root x in the larger vertex class, thereby generalizing results of B. Bollobás and E.J. Cockayne [“More Rotation Numbers for Complete Bipartite Graphs,” Journal of Graph Theory, Vol. 6 (1982), pp. 403–411], J. Haviland [“Cliques and Independent Sets,” Ph. D. thesis, University of Cambridge (1989)], and J. Haviland and A. Thomason [“Rotation Numbers for Complete Bipartite Graphs,” Journal of Graph Theory, Vol. 16 (1992), pp. 61–71]. © 1993 John Wiley & Sons, Inc.
A new domination conception
Authors: Stracke Christoph , Volkmann Lutz 
Published: June 2007

AbstractLet f be an integer valued function defined on the vertex set V(G) of a simple graph G. We call a subset Df of V(G) a f‐dominating set of G if |N(x, G) ∩ Df| ≥ f(x) for all x ∈ V(G) — Df, where N(x, G) is the set of neighbors of x. Df is a minimum f‐dominating set if G has no f‐dominating set D′f with |Df| < |Df|. If j, k ∈ N0 = {0,1,2,…} with j ≤ k, then we define the integer valued function fj,k on V(G) by
equation image
.By μj,k(G) we denote the cardinality of a minimum fj,k‐dominating set of G.A set D ⊆ V(G) is j‐dominating if every vertex, which is not in D, is adjacent to at least j vertices of D. The j‐domination number γj(G) is the minimum order of a j‐dominating set in G.In this paper we shall give estimations of the new domination number μj,k(G), and with the help of these estimations we prove some new and some known upper bounds for the j‐domination number. © 1993 John Wiley & Sons, Inc.
The complete closure of a graph
Authors: Faudree Ralph , Favaron Odile , Flandrin Evelyne , Li Hao 
Published: June 2007

AbstractWe define the complete closure number cc(G) of a graph G of order n as the greatest integer k ≤ 2n − 3 such that the kth Bondy‐Chvátal closure Clk(G) is complete, and give some necessary or sufficient conditions for a graph to have cc(G) = k. Similarly, the complete stability cs(P) of a property P defined on all the graphs of order n is the smallest integer k such that if Clk(G) is complete then G satisfies P. For some properties P, we compare cs(P) with the classical stability s(P) of P and show that cs(P) may be far smaller than s(P). © 1993 John Wiley & Sons, Inc.
Directed distance in digraphs: Centers and medians
Authors: Chartrand Gary , Johns Garry L. , Tian Songlin , Winters Steven J. 
Published: June 2007

AbstractThe directed distance dD(u, v) from a vertex u to a vertex v in a strong digraph D is the length of a shortest (directed) u ‐ v path in D. The eccentricity of a vertex v in D is the directed distance from v to a vertex furthest from v. The distance of a vertex v in D is the sum of the directed distances from v to the vertices of D. The center C(D) of D is the subdigraph induced by those vertices of minimum eccentricity, while the median M(D) of D is the subdigraph induced by those vertices of minimum distance. It is shown that for every two asymmetric digraphs D1 and D2, there exists a strong asymmetric digraph H such that C(H) ≅ D1 and M(H) ≅ D2, and where the directed distance from C(H) to M(H) and from M(H) to C(H) can be arbitrarily prescribed. Furthermore, if K is a nonempty asymmetric digraph isomorphic to an induced subdigraph of both D1 and D2, then there exists a strong asymmetric digraph F such that C(F) ≅ D1, M(F) ≅ D2 and C(F) ∩ M(F) ≅ K. © 1993 John Wiley & Sons, Inc.
On minors of graphs with at least 3n −4 edges
Authors: Khalifat M. , Politof Themistocles , Satyanarayana A. 
Published: June 2007

AbstractA point disconnecting set S of a graph G is a nontrivial m‐separator, where m = |S|, if the connected components of G ‐ S can be partitioned into two subgraphs, each of which has at least two points. A 3‐connected graph is quasi 4‐connected if it has no nontrivial 3‐separators. Suppose G is a graph having n ≥ 6 points. We prove three results: (1) If G is quasi 4‐connected with at least 3n ‐ 4 edges, then the graph K−1, obtained from K6 by deleting an edge, is a minor of G. (2) If G has at least 3n ‐ 4 edges then either K−6 or the graph obtained by pasting two disjoint copies of K5 together along a triangle is a minor of G. (3) If the minimum degree of G is at least 6, then K−6 is a minor of G. © 1993 John Wiley & Sons, Inc.
Equitable labelings of cycles
Authors: Wojciechowski Jerzy 
Published: June 2007

AbstractEvery labeling of the vertices of a graph with distinct natural numbers induces a natural labeling of its edges: the label of an edge (x, y) is the absolute value of the difference of the labels of x and y. By analogy with graceful labelings, we say that a labeling of the vertices of a graph of order n is minimally k‐equitable if the vertices are labeled with 1,2,…, n and in the induced labeling of its edges every label either occurs exactly k times or does not occur at all. Bloom [3] posed the following question: Is the condition that k is a proper divisor of n sufficient for the cycle Cn to have a minimal k‐equitable labeling? We give a positive answer to this question. © 1993 John Wiley & Sons, Inc.
A note on the last new vertex visited by a random walk
Authors: Lovász Lászlo , Winkler Peter 
Published: June 2007

AbstractA “cover tour” of a connected graph G from a vertex x is a random walk that begins at x, moves at each step with equal probability to any neighbor of its current vertex, and ends when it has hit every vertex of G. The cycle Cn is well known to have the curious property that a cover tour from any vertex is equally likely to end at any other vertex; the complete graph Kn shares this property, trivially, by symmetry. Ronald L. Graham has asked whether there are any other graphs with this property; we show that there are not. © 1993 John Wiley & Sons, Inc.
Applications of balance equations to vertex switching reconstruction
Authors: Krasikov I. 
Published: June 2007

AbstractA graph is called s‐vertex switching reconstructible (s‐VSR) if it is uniquely defined, up to isomorphism, by the multiset of unlabeled graphs obtained by switching of all its s‐vertex subsets. We show that a graph with n vertices is n/2‐VSR if n = 0(mod 4), (n − 2)/2‐VSR and n/2‐VSR if n = 2(mod 4), (n − 1)/2‐VSR if n = 1 (mod 2). For hypothetical nonreconstructible graphs, we give bounds on the number of edges (for any s) and on the maximum and minimum degree (for s = 2). We also show that for n > 9 the degree sequence is 2‐VSR.
Edge‐maximal (k, i)‐graphs
Authors: Lai Hong‐Jian , Zhang Cun‐Quan 
Published: June 2007

AbstractA graph G is a (k, l)‐graph if for any subgraph H of G, that |V(H)| ≧ implies that k(H) ≦ k − 1. An edge‐maximal (k, l‐graph G is one such that for any e ϵ E(Gc), G + e is not a (k, l)‐graph. In [F. T. Boesch and J. A. M. McHugh, „An Edge Extremal Result for Subcohesion,”︁ Journal of Combinatorial Theory B, vol. 38 (1985), pp. 1–7] a class of edge‐maximal graphs was found and used to show best possible upper bounds of the size of edge‐maximal (k, l)‐graphs. In this paper, we investigate the lower bounds of the size of edge‐maximal (k, l)‐graphs. Let f(n, k, l) denote the minimum size of edge‐maximal (k, l)‐graphs of order n. We shall give a characterization of edge‐maximal (k, l)‐graphs. This characterization is used to determine f(n, k, l) and to characterize the edge‐maximal (k, l)‐graphs with minimum sizes, for all n ≦ k + 2 ≦ 5. Thus prior results in [F.T. Boesch and J. A. M. McHugh, op. cit.; H.‐J. Lai, „The Size of Strength‐Maximal Graphs,”︁ Journal of Graph Theory, vol. 14 (1990), pp. 187–197] are extended.
New upper bounds on harmonious colorings
Authors: Edwards Keith , McDiarmid Colin 
Published: June 2007

AbstractWe present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also consider „fragmentable”︁ classes of graphs (an example is the class of planar graphs) that are, roughly speaking, graphs that can be decomposed into bounded‐sized components by removing a small proportion of the vertices. We show that for such graphs of bounded degree the harmonious chromatic number is close to the lower bound (2m)1/2, where m is the number of edges.
Equistable graphs
Authors: Mahadev N. V. R. , Peled Uri N. , Sun Feng 
Published: June 2007

AbstractAn equistable graph is a graph for which the incidence vectors of the maximal stable sets are the 0–1 solutions of a linear equation. A necessary condition and a sufficient condition for equistability are given. They are used to characterize the equistability of various classes of perfect graphs, outerplanar graphs, and pseudothreshold graphs. Some classes of equistable graphs are shown to be closed under graph substitution.
A common generalization of line graphs and clique graphs
Authors: Prisner Erich 
Published: June 2007

AbstractBoth the line graph and the clique graph are defined as intersection graphs of certain families of complete subgraphs of a graph. We generalize this concept. By a k‐edge of a graph we mean a complete subgraph with k vertices or a clique with fewer than k vertices. The k‐edge graph Δk(G) of a graph G is defined as the intersection graph of the set of all k‐edges of G. The following three problems are investigated for k‐edge graphs. The first is the characterization problem. Second, sets of graphs closed under the k‐edge graph operator are found. The third problem is the question of convergence: What happens to a graph if we take iterated k‐edge graphs?
Subdivided graphs have linear ramsey numbers
Authors: Alon Noga 
Published: June 2007

AbstractIt is shown that the Ramsey number of any graph with n vertices in which no two vertices of degree at least 3 are adjacent is at most 12n. In particular, the above estimate holds for the Ramsey number of any n‐vertex subdivision of an arbitrary graph, provided each edge of the original graph is subdivided at least once. This settles a problem of Burr and Erdös.