Results 281 to 290 of about 34,352 (308)

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 graph learning meets information bottleneck for out-of-distribution generalization [PDF]

Frontiers of Computer Science
Graph out-of-distribution (OOD) generalization remains a major challenge in graph learning since graph neural networks (GNNs) often suffer from severe performance degradation under distribution shifts.
Jiancan Wu, Yongduo Sui
exaly   +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

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

Tabular Invariants on Graphs and Their Application

Cybernetics and Systems Analysis, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On Topological Invariants of the Product of Graphs

Canadian Mathematical Bulletin, 1969
We 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, 1997
The 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, 2021
Benjamin Decardi-Nelson, Jinfeng Liu
exaly  

Graph Invariants for Fullerenes

Journal of Chemical Information and Computer Sciences, 1995
Alexandru T. Balaban, Xiaoyu Liu 0007, Douglas J. Klein, Darko Babic, Thomas G. Schmalz, William A. Seitz, Milan Randic   +6 more
openaire   +1 more source

An efficient implementation of graph-based invariant set algorithm for constrained nonlinear dynamical systems

Computers and Chemical Engineering, 2022
Benjamin Decardi-Nelson, Jinfeng Liu
exaly