Results 91 to 100 of about 41,123 (303)
Graphs, friends and acquaintances
A graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Many of the first results concerning graphs made reference to relationships between groups of people.
Cristina Dalfo, Miquel Àngel Fiol
doaj +1 more source
Parallelogram-Free Distance-Regular Graphs
This paper deals with distance-regular graphs. It is shown that a distance-regular graph with certain properties has classical parameters \((d,b,\alpha,\beta)\) with ...
Yuh-jeng Liang, Chih-Wen Weng
openaire +2 more sources
A distance-regular graph with bipartite geodetically closed subgraphs [PDF]
Let Γ be a distance-regular graph of diameter d, and t be an integer with 2≤t≤d−1 such that at−1=0. For any pair (u,v) of vertices, let Π(u,v) be the subgraph induced by the vertices lying on shortest paths between u and v.
Hiraki, Akira
core +1 more source
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
A Novel Description on Vague Graph with Application in Transportation Systems
Fuzzy graph (FG) models embrace the ubiquity of existing in natural and man-made structures, specifically dynamic processes in physical, biological, and social systems.
Zheng Kou, Saeed Kosari, Maryam Akhoundi
doaj +1 more source
Nonexistence of a Class of Distance-Regular Graphs
Let $\Gamma$ denote a distance-regular graph with diameter $D \geq 3$ and intersection numbers $a_1=0, a_2 \neq 0$, and $c_2=1$. We show a connection between the $d$-bounded property and the nonexistence of parallelograms of any length up to $d+1$. Assume further that $\Gamma$ is with classical parameters $(D, b, \alpha, \beta)$, Pan and Weng (2009 ...
Yu-Pei Huang +2 more
openaire +2 more sources
An inequality on the cosines of a tight distance-regular graph [PDF]
Let Γ denote a distance-regular graph with diameter d⩾3, and assume Γ is tight in the sense of Jurišić et al. [J. Algebraic Combin. 12 (2000) 163–197]. Let θ denote the second largest or the smallest eigenvalue of Γ. We obtain an inequality involving the
Pascasio, Arlene A.
core +1 more source
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source
On automorphisms of a distance-regular graph with intersection array 44, 30, 5; 1, 3, 40 [PDF]
Prime divisors of orders of automorphisms and the fixed point subgraphs of automorphisms of prime orders are studied for a hypothetical distance-regular graph with intersection array 44, 30, 5; 1, 3, 40. Let G = Aut(Γ) is nonsolvable group.
Bitkina, V. V. +2 more
core +1 more source
Importin 7 mediates the nuclear import of HIV‐1 integrase via a specific interacting interface
HIV‐1 integrase enables viral DNA integration into the host genome. By binding to the core domain of the host protein Importin 7 via its C‐terminal domain, the integrase is transported across the nuclear membrane into the nucleus, where integration of the viral genome into host DNA takes place. This translocation is a critical step for subsequent viral
Juana Bana +5 more
wiley +1 more source

