Results 241 to 250 of about 1,232,284 (259)
Predicting pyrazinamide resistance in Mycobacterium tuberculosis using a graph convolutional network
Dissanayake D, Morrone JA, Fowler PW.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2010
The distance between two vertices is the basis of the definition of several graph parameters including diameter, radius, average distance and metric dimension. These invariants are examined, especially how they relate to one another and to other graph invariants and their behaviour in certain graph classes.
Wayne Goddard, Ortrud R. Oellermann
openaire +1 more source
The distance between two vertices is the basis of the definition of several graph parameters including diameter, radius, average distance and metric dimension. These invariants are examined, especially how they relate to one another and to other graph invariants and their behaviour in certain graph classes.
Wayne Goddard, Ortrud R. Oellermann
openaire +1 more source
Graph similarity and distance in graphs
Aequationes Mathematicae, 1998For a one-one map \(\phi\) between two connected graphs of the same order their \(\phi\)-distance is the sum over all vertex pairs of the first graph of the absolute difference between their distance and the distance of their \(\phi\)-images. The distance between the graphs is the minimum \(\phi\)-distance over all possible \(\phi\).
Chartrand, Gary +2 more
openaire +1 more source
DISTANCES IN GRAPHS OF PERMUTATIONS
Rocky Mountain Journal of MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dougherty, Steven T., Gianello, Mia
openaire +2 more sources
Journal of Mathematical Chemistry, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klavžar, Sandi, Nadjafi-Arani, M. J.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klavžar, Sandi, Nadjafi-Arani, M. J.
openaire +2 more sources
The Journal of Physical Chemistry A, 2004
This paper discusses the finding of vertex to vertex distances in molecular graphs. Having found these distances. one can obtain a method for canonical numbering of the atoms in a molecule, which depends on the atomic properties and the distances between equivalence classes. This does not use the traditional Morgan algorithm.
Wataru Katouda +5 more
openaire +1 more source
This paper discusses the finding of vertex to vertex distances in molecular graphs. Having found these distances. one can obtain a method for canonical numbering of the atoms in a molecule, which depends on the atomic properties and the distances between equivalence classes. This does not use the traditional Morgan algorithm.
Wataru Katouda +5 more
openaire +1 more source
1993
Abstract For vertices u and v in a connected graph G, the detour distance d* (u, v) between u and v is the length of a longest path P for which the subgraph induced by the vertices of P is P itself. A graph G is called a detour graph if d* (u, v) equals the standard distance between u and v in G for every pair u, v of vertices of G.
Gary Chartrand +2 more
openaire +1 more source
Abstract For vertices u and v in a connected graph G, the detour distance d* (u, v) between u and v is the length of a longest path P for which the subgraph induced by the vertices of P is P itself. A graph G is called a detour graph if d* (u, v) equals the standard distance between u and v in G for every pair u, v of vertices of G.
Gary Chartrand +2 more
openaire +1 more source
Increasing distances in graphs [PDF]
, 2006 In der vorliegenden Arbeit wird ein spezielles Set Cover Problem studiert. Es ist eng mit minimalen Schnitten in Graphen verbunden, d.h. mit Problemen, bei denen alle Wege zwischen den Knoten eines oder mehrerer gegebener Knotenpaare unterbrochen werden.
openaire +1 more source
2020
For an integer k ≥ 1, a (distance) k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G) ∖ S is at distance at most k from some vertex of S. The k-domination number, γk(G), of G is the minimum cardinality of a k-dominating set of G. In this chapter, we survey selected results on the k-domination number of a
openaire +1 more source
For an integer k ≥ 1, a (distance) k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G) ∖ S is at distance at most k from some vertex of S. The k-domination number, γk(G), of G is the minimum cardinality of a k-dominating set of G. In this chapter, we survey selected results on the k-domination number of a
openaire +1 more source
Codes in Shilla Distance-Regular Graphs
Proceedings of the Steklov Institute of Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source