Results 71 to 80 of about 41,123 (303)
ENUMERATION INTERSECTION ARRAYS OF SHILLA GRAPHS WITH B = 6
Let \(\Gamma\) be a distance-regular graph of diameter \(3\), and let \(\theta_1\) be its second eigenvalue. The graph \(\Gamma\) is called a Shilla graph if \(\theta_1=a_3\). In this case, \(\theta_1={(a_1+\sqrt{a_1^2+4k})}/{2}\), and \(a=a_3\) divides \
Alexander A. Makhnev +2 more
doaj +1 more source
Characteristics studies of molecular structures in drugs
In theoretical medicine, topological indices are defined to test the medicine and pharmacy characteristics, such as melting point, boiling point, toxicity and other biological activities.
Wei Gao +3 more
doaj +1 more source
On the girth of a thin distance-regular graph [PDF]
This thesis is an exposition of the article The Girth of a Thin Distance-regular Graph by Benjamin V.C. Collins, which was published in the Journal of Graphs and Combinatorics (1997) [3].
Toto, Maria Criselda S.
core
Moore–Penrose inverse of the incidence matrix of a distance regular graph [PDF]
Let Γ be a graph with n vertices, where each edge is given an orientation and let Q be the vertex-edge incidence matrix. We obtain a formula for the Moore–Penrose inverse of Q, when Γ is a distance regular graph.
R.B. Bapat +3 more
core +1 more source
Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura +19 more
wiley +1 more source
The reciprocal complementary distance (RCD) matrix of a graph $G$ is defined as $RCD(G) = [rc_{ij}]$ where $rc_{ij} = \frac{1}{1+D-d_{ij}}$ if $i \neq j$ and $rc_{ij} = 0$, otherwise, where $D$ is the diameter of $G$ and $d_{ij}$ is the distance between ...
Harishchandra S. Ramane +1 more
doaj +1 more source
Distance-regular antipodai covering graphs
Let G be a regular graph with diameter d. G is said to be antipodal if given any distinct vertices u, v, w of G with v and w at distance d from u, then v is distance d from w. G is called distance-regular if for vertices u, v, in G of distance i apart, v is adjacent to \(c_ i\) vertices distance i-1 from u, \(a_ i\) vertices distance i from u, and \(b_
Robert E. L. Aldred, Chris D. Godsil
openaire +2 more sources
Bounding the Diameter of a Distance Regular Graph by a Function of kd, II [PDF]
Let Γ be a distance regular graph of diameter d and kd the cardinality of vertices at distance d from a vertex α.
Suzuki, H.
core +1 more source
Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma
Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski +10 more
wiley +1 more source
A flocking algorithm for multi-agent systems with connectivity preservation under hybrid metric-topological interactions. [PDF]
In this paper, we propose a connectivity-preserving flocking algorithm for multi-agent systems in which the neighbor set of each agent is determined by the hybrid metric-topological distance so that the interaction topology can be represented as the ...
Chenlong He, Zuren Feng, Zhigang Ren
doaj +1 more source

