Results 91 to 100 of about 321,891 (280)

ENUMERATION INTERSECTION ARRAYS OF SHILLA GRAPHS WITH B = 6

Ural Mathematical Journal
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, Ivan N. Belousov, Mikhail P. Golubyatnikov   +2 more
doaj   +1 more source

Resistance Distance and Kirchhoff Index of $Q$ -Double Join Graphs

IEEE Access, 2019
Let Q(G) be the graph derived from G by inserting a new vertex into every edge of G and by connecting edges of these new vertices that are on adjacent edges of G, and Q-double join of G, G1 and G2 denoted by GQ v{G1, G2}, is the graph derived from Q(G ...
Weizhong Wang, Tingyan Ma, Jia-Bao Liu
doaj   +1 more source

Weakly distance-regular digraphs whose underlying graphs are distance-regular, I

Journal of Algebraic Combinatorics
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes, or Doob graphs. In this paper, we classify all commutative weakly distance-regular digraphs whose underlying graphs are Johnson ...
Yang, Yuefeng, Zeng, Qing, Wang, Kaishun
openaire   +3 more sources

Unleashing the Power of Machine Learning in Nanomedicine Formulation Development

Advanced Functional Materials, EarlyView.
A random forest machine learning model is able to make predictions on nanoparticle attributes of different nanomedicines (i.e. lipid nanoparticles, liposomes, or PLGA nanoparticles) based on microfluidic formulation parameters. Machine learning models are based on a database of nanoparticle formulations, and models are able to generate unique solutions
Thomas L. Moore, Cristiano Pesce, Antonietta Greco, Claudia Pisante, Greta Avancini, Valentina Di Francesco, Yosi Shamay, Paolo Decuzzi   +7 more
wiley   +1 more source

Distance-regular graphs of hamming type

Journal of Combinatorial Theory, Series B, 1990
An H(e,\(\lambda\),k)-graph is defined to be a distance-regular graph with the following intersection array \[ \left\{\begin{matrix} 0 & 1 & 2 &... & e-1 & e & *...* \\ 0 & \lambda & 2\lambda & ... & (e-1)\lambda & * & *...* & \\ k & * & * & ... & * & * & *...* \end{matrix}\right\} \] where * takes an arbitrary value under the restriction that each ...
openaire   +2 more sources

Expanding Chemical Space of Nucleic Acid Nanoparticles for Tunable Antiviral‐Like Immunomodulatory Responses and Potent Adjuvant Activity

Advanced Functional Materials, EarlyView.
We introduce a nucleic acid nanoparticle (NANP) platform designed to be rrecognized by the human innate immune system in a regulated manner. By changing chemical composition while maintaining constant architectural parameters, we identify key determinants of immunorecognition enabling the rational design of NANPs with tunable immune activation profiles
Martin Panigaj, Hannah S. Newton, Jian Wang, Laxmi Pandey, Yelixza I. Avilla, Phong Nguyen, Morgan Chandler, Justin Halman, Yasmine Radwan, Stephanie Smith, Elijah Edmondson, Simone Difilippantonio, Chelsea Sanders, Bao Tran, Yongmei Zhao, Shaojun Xie, Edward Cedrone, Barry W. Neun, Meni Wanunu, Nikolay V. Dokholyan, Marina A. Dobrovolskaia, Kirill A. Afonin   +21 more
wiley   +1 more source

Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs

Journal of Applied Mathematics, 2017
The Gutman index of a connected graph G is defined as Gut(G)=∑u≠vd(u)d(v)d(u,v), where d(u)  and  d(v) are the degree of the vertices u  and  v and d(u,v) is the distance between vertices u  and  v.
S. Kavithaa, V. Kaladevi
doaj   +1 more source

Retracing Argument for Distance-Regular Graphs

Journal of Combinatorial Theory, Series B, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A Vascular Microphysiological Model of Lung Fibrosis Reveals That Myofibroblasts and IPF Patient‐Derived Fibroblasts Impair Angiogenesis and Vasculogenesis

Advanced Functional Materials, EarlyView.
A microphysiological lung fibrosis model recapitulates myofibroblast–vascular interactions. Induced myofibroblasts and patient‐derived IPF fibroblasts impair angiogenesis and increase vascular permeability via TGF‐β1–driven signaling. Pharmacological interventions with SB 431542 and VEGF supplementation restore vascular morphology and barrier function.
Elena Cambria, Adriana Blazeski, Eunkyung Clare Ko, Tran Thai, Shania Dantes, David A. Barbie, Sarah E. Shelton, Roger D. Kamm   +7 more
wiley   +1 more source

On Distance Magic Harary Graphs

, 2018
This paper establishes two techniques to construct larger distance magic and (a, d)-distance antimagic graphs using Harary graphs and provides a solution to the existence of distance magicness of legicographic product and direct product of G with C4, for
Paramasivam, Krishnan, Prajeesh, A V
core