Results 1 to 10 of about 832,958 (281)
Leveraging Different Distance Functions to Predict Antiviral Peptides with Geometric Deep Learning from ESMFold-Predicted Tertiary Structures [PDF]
AntibioticsBackground: Machine learning models have been shown to be a time-saving and cost-effective tool for peptide-based drug discovery. In this regard, different graph learning-driven frameworks have been introduced to exploit graph representations derived ...
Greneter Cordoves-Delgado +4 more
doaj +2 more sources
Distance (signless) Laplacian spectrum of dumbbell graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we determine the distance Laplacian and distance signless Laplacian spectrum of generalized wheel graphs and a new class of graphs called dumbbell graphs.
Sakthidevi Kaliyaperumal +1 more
doaj +1 more source
On Eccentricity Version of Zagreb Coindices [PDF]
Mathematics Interdisciplinary Research, 2021 The eccentric connectivity coindex has recently been introduced (Hua and Miao, 2019) as the total eccentricity sum of all pairs of non-adjacent vertices in a graph.
Mahdieh Azari
doaj +1 more source
Szeged-type indices of subdivision vertex-edge join (SVE-join)
Main Group Metal Chemistry, 2021 In this article, we compute the vertex Padmakar-Ivan (PIv) index, vertex Szeged (Szv) index, edge Padmakar-Ivan (PIe) index, edge Szeged (Sze) index, weighted vertex Padmakar-Ivan (wPIv) index, and weighted vertex Szeged (wSzv) index of a graph product ...
Asghar Syed Sheraz +4 more
doaj +1 more source
A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2
Algorithms, 2021 Cicerone and Di Stefano defined and studied the class of k-distance-hereditary graphs, i.e., graphs where the distance in each connected induced subgraph is at most k times the distance in the whole graph. The defined graphs represent a generalization of
Serafino Cicerone
doaj +1 more source
The Generalized Distance Spectrum of the Join of Graphs [PDF]
, 2020 Let G be a simple connected graph. In this paper, we study the spectral properties of the generalized distance matrix of graphs, the convex combination of the symmetric distance matrix D(G) and diagonal matrix of the vertex transmissions Tr(G) .
Alhevaz, Abdollah +3 more
core +2 more sources
AKCE International Journal of Graphs and Combinatorics, 2020 The status of a vertex , denoted by , is the sum of the distances between and all other vertices in a graph . The first and second status connectivity indices of a graph are defined as and respectively, where denotes the edge set of .
Harishchandra S. Ramane +2 more
doaj +1 more source
The Threshold Dimension and Irreducible Graphs
Discussiones Mathematicae Graph Theory, 2023 Let G be a graph, and let u, v, and w be vertices of G. If the distance between u and w does not equal the distance between v and w, then w is said to resolve u and v.
Mol Lucas +2 more
doaj +1 more source
Weiner Polynomials to Generalize the Distance of Some Composite Graphs from Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2008 It is not easy to find the Wiener polynomials for generalized distance of compound graphs constructed in the form and for any two disjoint connected graphs and .Therefore, in this paper, we obtain Wiener polynomials for generalized distance of and ...
Ali Ali, Ahmed Ali
doaj +1 more source
Dualizing Distance-Hereditary Graphs
Discussiones Mathematicae Graph Theory, 2021 Distance-hereditary graphs can be characterized by every cycle of length at least 5 having crossing chords. This makes distance-hereditary graphs susceptible to dualizing, using the common extension of geometric face/vertex planar graph duality to cycle ...
McKee Terry A.
doaj +1 more source