Results 241 to 250 of about 29,541 (268)
Some of the next articles are maybe not open access.
Color Invariant for Spatial Graphs
Journal of Knot Theory and Its Ramifications, 1997The 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
Tabular Invariants on Graphs and Their Application
Cybernetics and Systems Analysis, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Topological Invariants of the Product of Graphs
Canadian Mathematical Bulletin, 1969We consider ordinary graphs, that is, finite, undirected graphs with no loops or multiple lines. The product (also called cartesian product [4]) G1 × G2 of two graphs G1 and G2 with point sets V1 and V2, respectively, has the cartesian product V1 × V2 as its set of points. Two points (u1, u2) and (v1, v2) are adjacent if u1 = v1 and u2 is adjacent with
Behzad, M., Mahmoodian, S. E.
openaire +2 more sources
Expanding graphs and invariant means
Combinatorica, 1997The paper studies explicit constructions of expander families, the Cayley graphs determined by a group and a generator set. These constructions are far from being trivial, see, for example, \textit{A. Lubotzky, R. Phillips} and \textit{P. Sarnak} [Combinatorica 8, No. 3, 261-277 (1988; Zbl 0661.05035)] and \textit{G. A. Margulis} [Probl. Inf.
openaire +1 more source
Computing robust control invariant sets of constrained nonlinear systems: A graph algorithm approach
Computers and Chemical Engineering, 2021Jinfeng Liu, Benjamin Decardi-Nelson
exaly
Graph Invariants for Fullerenes
Journal of Chemical Information and Computer Sciences, 1995Alexandru T. Balaban +6 more
openaire +1 more source
Domain-invariant Graph for Adaptive Semi-supervised Domain Adaptation
ACM Transactions on Multimedia Computing, Communications and Applications, 2022Changsheng Xu +2 more
exaly
PINE: Universal Deep Embedding for Graph Nodes via Partial Permutation Invariant Set Functions
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2022Jieping Ye +2 more
exaly
A Wiener-type graph invariant for some bipartite graphs
Applied Mathematics Letters, 1995Ivan Gutman
exaly

