On geometric distance-regular graphs with diameter three

In this paper we study distance-regular graphs with intersection array {(t + 1)s. ts. (t - 1)(s + 1 - psi); 1, 2, (t + 1)psi} (1) where s. t. psi are integers satisfying t >= 2 and 1 = 2, there are only finitely many distance-regular graphs of order (s, t) with mallest eigenvalue -t -1, diameter D = 3 and intersection number c(2) = 2 except for Hamming graphs with diameter three. Moreover, we will show that if a distance-regular graph with intersection array (1) for t = 2 exists then (s, psi) = (15, 9). As Gavrilyuk and Makhnev (2013)[9] proved that the case (s, psi) = (15, 9) does not exist, this enables us to finish the classification of geometric distance-regular graphs with smallest eigenvalue -3, diameter D >= 3 and c(2) >= 2 which was started by the first author (Bang, 2013)[1]. (C) 2013 Elsevier Ltd. All rights reserved.X1121Ysciescopu

FDG-PET-CT in the early response evaluation for primary systemic therapy of breast cancer

Primary systemic therapy (PST) is a standard treatment for patients with locally advanced breast cancer. We report one of our patients to demonstrate the optimal use of FDG-PET-CT in the routine clinical workup during PST, especially when clinicians face contradictory clinical and pathological findings, and to show the advantages of this imaging modality in the decision-making process about the initial treatment choice. By reviewing the literature we would also like to confirm that FDG-PET-CT is highly sensitive in the measurement of the early therapeutic response and the prediction of the complete pathological remission, as early as after the first cycle of chemotherapy is administered. © 2014 Versita and Springer-Verlag

The Human Phenotype Ontology in 2024: phenotypes around the world

\ua9 The Author(s) 2023. Published by Oxford University Press on behalf of Nucleic Acids Research. The Human Phenotype Ontology (HPO) is a widely used resource that comprehensively organizes and defines the phenotypic features of human disease, enabling computational inference and supporting genomic and phenotypic analyses through semantic similarity and machine learning algorithms. The HPO has widespread applications in clinical diagnostics and translational research, including genomic diagnostics, gene-disease discovery, and cohort analytics. In recent years, groups around the world have developed translations of the HPO from English to other languages, and the HPO browser has been internationalized, allowing users to view HPO term labels and in many cases synonyms and definitions in ten languages in addition to English. Since our last report, a total of 2239 new HPO terms and 49235 new HPO annotations were developed, many in collaboration with external groups in the fields of psychiatry, arthrogryposis, immunology and cardiology. The Medical Action Ontology (MAxO) is a new effort to model treatments and other measures taken for clinical management. Finally, the HPO consortium is contributing to efforts to integrate the HPO and the GA4GH Phenopacket Schema into electronic health records (EHRs) with the goal of more standardized and computable integration of rare disease data in EHRs

Hyperbolic bridged graphs

Given a connected graph G, we take, as usual, the distance xy between any two vertices x, y of G to be the length of some geodesic between x and y. The graph G is said to be delta-hyperbolic, for some 3 : 0, if for all vertices x, y, u, v in G the inequality xy + uv :5 max{xu + yv, xv + yu} + delta holds, and G is bridged if it contains no finite isometric cycles of length four or more. In this paper, we will show that a finite connected bridged graph is 1-hyperbolic if and only if it does not contain any of a list of six graphs as an isometric subgraph. (C) 2002 Elsevier Science Ltd. All rights reserved.X1141sciescopu

The vertex-connectivity of a distance-regular graph

The vertex-connectivity of a distance-regular graph equals its valency. (C) 2008 Dr Andries E. Brouwer. Published by Elsevier Ltd. All rights reserved.X1118sciescopu

Some interlacing results for the eigenvalues of distance-regular graphs

In this paper we study the absolute values of non-trivial eigenvalues of a distance-regular graph and find that these usually have large absolute value. We also give a motivation concerning a conjecture of Bannai and Ito.X11sciescopu

A relationship between the diameter and the intersection number c (2) for a distance-regular graph

In this paper we will look at the relationship between the intersection number c (2) and the diameter of a distance-regular graph. We also give some tools to show that a distance-regular graph with large c (2) is bipartite, and a tool to show that if k (D) is too small then the distance-regular graph has to be antipodal.X1142sciescopu

The distance-regular graphs such that all of its second largest local eigenvalues are at most one

In this paper, we classify distance-regular graphs such that all of its second largest local eigenvalues are at most one. Also we discuss the consequences for the smallest eigenvalue of a distance-regular graph. These extend a result by the first author, who classified the distance-regular graphs with smallest eigenvalue -1 - b(1)/2. (C) 2011 Elsevier Inc. All rights reserved.X1154sciescopu