Results 231 to 240 of about 3,118,294 (254)

In search of a complete invariant for graphs

1981
Let A be the adjacency matrix of an ordinary (simple) graph G and A′=xI+λA+(J-A-I) where I is the n×n identity matrix and J is the n×n matrix of l’s. Then we call P(x,λ)=Per(A′) the permanent polynomial of G. A frame (2-matching) of a graph G is a spanning subgraph F of G whose components are single points, single lines, paths or cycles.
K. Balasubramanian, K. R. Parthasarathy
openaire   +1 more source

A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT

Journal of Knot Theory and Its Ramifications, 2003
Let k be a non-negative integer. Then any embedding of the complete graph on 6·2k vertices into a three-space contains a two-component link with the absolute value of its linking number greater than or equal to 2k. Let j be a non-negative integer. Then any embedding of the complete graph on 48·2j vertices into a three-space contains a knot with the ...
Shirai, Minori, Taniyama, Kouki
openaire   +1 more source

A multicolour graph as a complete topological invariant for $\Omega$-stable flows without periodic trajectories on surfaces

Sbornik Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olga Pochinka, D S Malyshev
exaly   +2 more sources

An invariant for one-factorizations of the complete graph

Ars Comb., 1996
A one-factor of a graph is a set of edges containing each vertex precisely once. A one-factorization of the complete graph \(K_{2n}\) is a partition of the edge set into one-factors. Two one-factorizations are isomorphic if there is a bijection of the vertex set which maps one-factors to one-factors.
Terry S. Griggs, Alexander Rosa
openaire   +2 more sources

Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor

Journal of Combinatorial Designs, 1994
AbstractWe give some simple characterizations of those n for which Kn has a sharply transitive 1‐factorization with an assigned automorphism group that acts sharply transitively on the vertex set and also fixes a 1‐factor. © 1994 John Wiley & Sons, Inc.
openaire   +2 more sources

The Proof of Completeness of the Graph Method for Generation of Affine Moment Invariants

2010
Features for recognition of affinely distorted objects are of great demand. The affine moment invariants can be generated by a few methods, namely the graph method, the tensor method and the direct solution of the Cayley-Aronhold differential equation. The proof of their equivalence is complicated; it can be derived from the Gurevich's proof for affine
openaire   +1 more source

A Complete Set of Combination Invariants of Planar Honeycomb Graphs and Its Applications in Chemistry

Annals of the New York Academy of Sciences, 1989
WENJIE HE, WENCHEN HE
openaire   +1 more source

Homological invariants of some complete split-like graphs

Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry
Sonica Anand, Nidhi Gupta, Shahnawaz Ahmad Rather, Pavinder Singh   +3 more
openaire   +1 more source

Uncountable graphs and invariant measures on the set of universal countable graphs

Random Structures and Algorithms, 2010
Fedor Petrov, Anatoly Vershik
exaly  

Invariant factors of graphs associated with hyperplane arrangements

Discrete Mathematics, 2004
Wai-Chee Shiu
exaly