Results 231 to 240 of about 29,541 (268)

Universal dense-open windows for generic conservative surface semigroups and graph-directed local systems

Shmalo Y.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

On factor-invariant graphs

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

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

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

A Shy Invariant of Graphs

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

An Invariant of the Graph Isomorphism

2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application, 2008
The adjacent matrix is defined in this paper for a given graph, and the deformation called dual congruent act on the matrix is discussed. We have shown that any two graphs are isomorphic each other if and only if they having the dual congruent adjacent matrices. So the adjacent matrix of graph is a isomorphic invariants for graph theory.
openaire   +1 more source

Polynomial invariants of graphs II

Graphs and Combinatorics, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seiya Negami, Katsuhiro Ota
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