Results 241 to 250 of about 316,679 (279)

Committors without Descriptors. [PDF]

J Chem Theory Comput
Kang P, Zhang J, Trizio E, Hou T, Parrinello M.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Isotopy Invariants of Graphs

Transactions of the American Mathematical Society, 1991
The development of oriented and semioriented algebraic invariants associated to a class of embeddings of regular four valent graphs is given. These generalize the analogous invariants for classical knots and links, can be determined from them by means of a weighted averaging process, and define them by means of a new state model.
Jonish, D., Millett, K. C.
openaire   +2 more sources

Color Invariant for Spatial Graphs

Journal of Knot Theory and Its Ramifications, 1997
The method of distinguishing knots and links using the colorability of their diagrams was invented by Ralph Fox [2]. As generalization of this method, we introduce certain method of distinguishing spatial graphs.
Ishii, Yuko, Yasuhara, Akira
openaire   +2 more sources

INVARIANTS OF GRAPHS

Journal of Knot Theory and Its Ramifications, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Polynomial invariants of graphs II

Graphs and Combinatorics, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Negami, Seiya, Ota, Katsuhiro
openaire   +2 more sources

On factor-invariant graphs

Discrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alspach, Brian, Khodadadpour, Afsaneh, Kreher, Donald L.   +2 more
openaire   +1 more source

A Shy Invariant of Graphs

Graphs and Combinatorics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Invariants of E-graphs

International Journal of Computer Mathematics, 1995
An E-graph is constructed by replacing each edge in a core graph G with a copy of a graph H. An important property of E-graphs is that their invariant values can be determined from parameters of the original graphs G and H. We determine chromatic number, clique number, vertex and edge cover numbers, vertex and edge independence numbers, circumference ...
Teresa W. Haynes, Linda M. Lawson
openaire   +2 more sources

Invariant intersection graph of a graph

Journal of Discrete Mathematical Sciences & Cryptography
Studies in algebraic graph theory showcase the interplay between group theory and graph theory by defining graphs on groups, investigating their properties, and also by analysing the automorphism groups that emerge from the graphs. In this article, we introduce the idea of constructing an algebraic derived graph; that is, constructing a graph based on ...
S. Madhumitha, Sudev Naduvath
openaire   +1 more source