Results 1 to 10 of about 177,806 (308)
Annals of Combinatorics, 2008 Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: The number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained.
Janja Jerebic +2 more
exaly +3 more sources
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 spectrum of Indu–Bala product of graphs
AKCE International Journal of Graphs and Combinatorics, 2016 The D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D and form the distance spectrum or D-spectrum of G denoted by SpecD(G). Let G1 and G2 be two regular graphs. The Indu–Bala product of G1 and G2 is denoted by
G. Indulal, R. Balakrishnan
doaj +3 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
Monophonic Distance in Graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2011 For any two vertices u and v in a connected graph G, a u – v path is a monophonic path if it contains no chords, and the monophonic distance dm(u, v) from u to v is defined as the length of a longest u – v monophonic path in G. A u – v monophonic path of length dm(u, v) is called a u – v monophonic. The monophonic eccentricity em(v) of a vertex v in G
A. P. Santhakumaran, P. Titus
openaire +2 more sources
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
Distance labeling in graphs [PDF]
Journal of Algorithms, 2004 Summary: We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additional information). Our main interest is in the minimal length of labels needed in different cases.
Gavoille, Cyril +3 more
openaire +4 more sources
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