Results 41 to 50 of about 217,223 (279)
On Sum--Connectivity Index of Bicyclic Graphs
, 2009 We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\le m\le \lfloor\frac{n}{2}\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with $n\ge 5$ vertices. The extremal graphs are characterized.
Du, Zhibin, Zhou, Bo
openaire +3 more sources
Families and clustering in a natural numbers network [PDF]
, 2003 We develop a network in which the natural numbers are the vertices. We use the decomposition of natural numbers by prime numbers to establish the connections. We perform data collapse and show that the degree distribution of these networks scale linearly
Corso, Gilberto
core +1 more source
On the general sum-connectivity index of trees
Applied Mathematics Letters, 2011 The general sum-connectivity index of a graph G is defined as chi(alpha)(G) = Sigma(uvE(G))(d(u) + d(v))(alpha) where du denotes the degree of vertex u in G, E(G) denotes the edge set of G and alpha is a real number. We determine the maximum value for the general sum-connectivity indices of n-vertex trees and the corresponding extremal trees for alpha <
Du, Zhibin, Zhou, Bo, Trinajstić, Nenad
openaire +3 more sources
Sharp inequalities for the atom-bond (sum) connectivity index
Journal of Mathematical Inequalities, 2023 For a graph \(G\), the atom-bond connectivity (ABC) index (respectively, atom-bond sum connectivity (ABS) index) of \(G\) is defined as the sum of the numbers \(\sqrt{\frac{d_i +d_j-2} {d_id_j}}\) (respectively, \(\sqrt{\frac{d_i +d_j -2} {d_i + d_j}}\) ) over all the unordered pairs \(\{v_i,v_j\}\) of adjacent vertices of \(G\), where \(d_i\) and ...
Ali, Akbar +3 more
openaire +1 more source
Acta Chimica Slovenica, 2017 The Randić Connectivity Index R(G) is one of the oldest connectivity index, introduced by Randić in 1975. Another connectivity indices is the Sum-Connectivity Index X(G) introduced in 2008 by Zhou and Trinajstić.
Wei Gao +2 more
doaj +1 more source
, 2013 Interrelated Two-way Clustering (ITC) is an unsupervised clustering method developed to divide samples into two groups in gene expression data obtained through microarrays, selecting important genes simultaneously in the process.
Basak, Subhash C. +2 more
core +1 more source
In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS
FEBS Letters, EarlyView.We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka +11 more
wiley +1 more source
FEBS Letters, EarlyView.The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 more
wiley +1 more source
On the eccentric connectivity coindex in graphs
AIMS Mathematics, 2022 The well-studied eccentric connectivity index directly consider the contribution of all edges in a graph. By considering the total eccentricity sum of all non-adjacent vertex, Hua et al.
Hongzhuan Wang, Xianhao Shi, Ber-Lin Yu
doaj +1 more source
A Bag-of-Paths Node Criticality Measure
, 2017 This work compares several node (and network) criticality measures quantifying to which extend each node is critical with respect to the communication flow between nodes of the network, and introduces a new measure based on the Bag-of-Paths (BoP ...
Lebichot, Bertrand, Saerens, Marco
core +1 more source