These include centrality, clustering, adjacency, distance, community structure, bipartivity, subgraphs, and communicability, among others.
Increasing the adjacency distance beyond 2 was explored but was found to be infeasible because of very low precision.
Starting with only the atomic coordinates, we create an adjacency and distance matrix that facilitates the calculation of topological indices, including the Wiener, hyper-Wiener, reverse Wiener, Szeged, Balaban, and Kirchhoff indices.
Quantitative (handling cost) and qualitative (adjacency and distance requests between departments) objectives are considered referring to a bay structure-based layout model, that allows to take into account also practical constraints such as the aspect ratio of departments.
The relations between ancestral markers can take several forms, such as adjacency or distance between pairs of markers, or contiguity/synteny of a subset of markers for example.
The efficiency of topological descriptors to estimate PL (r ranges from 0.515 to 0.804; Table S6) showed that adjacency and distance in chemical graphs, being general descriptors of molecular size, shape, and branching, are important in predicting this parameter.
We also used models with random effects set at the intercepts to take account of possible intradistrict correlations and with an extension to take account of spatial autocorrelations due to adjacency or distance decay between TPUs (Burnett et al. 2001; Ma et al. 2003).
Four of these genomes (horse, chimpanzee, rhesus, and orangutan) are not well assembled: their draft genomes have nearly twice as many contigs as there are chromosomes but the effect on our adjacency-based distance estimator is minimal, given the large number of markers.
Highly discriminating adjacency-cum-distance based topochemical indices termed as superaugmented eccentric connectivity topochemical indices for quantitative structure activity and structure property relationships (QSAR/QSPR) have been conceptualized in the present study.
As depicted in the same paper, if are the eigenvalues of the adjacency, Laplacian, or distance matrix of some graph, then graph energy, Laplacian energy, and distance energy are the special cases of.
In particular, as similarly in, if are the eigenvalues of the adjacency, Laplacian, or distance matrix of some of, then is the Estrada index (see [5, 8, 14, 15]), Laplacian Estrada index (see [17]), or distance Estrada index (see [18]), respectively, of some graph.
