Results 31 to 40 of about 316,679 (279)

Polynomial Invariants of Graphs [PDF]

Transactions of the American Mathematical Society, 1987
We define two polynomials f ( G ) f(G) and f ∗ ( G ) {f^{\ast }}(G) for a graph G G by a recursive formula with respect to deformation of graphs.
openaire   +2 more sources

On invariant Schreier structures [PDF]

, 2014
Schreier graphs, which possess both a graph structure and a Schreier structure (an edge-labeling by the generators of a group), are objects of fundamental importance in group theory and geometry.
Cannizzo, Jan
core   +1 more source

Invariance, Quasi-Invariance, and Unimodularity for Random Graphs [PDF]

Journal of Mathematical Sciences, 2016
We interpret the probabilistic notion of unimodularity for measures on the space of rooted locally finite connected graphs in terms of the theory of measured equivalence relations. It turns out that the right framework for this consists in considering quasi-invariant (rather than just invariant) measures with respect to the root moving equivalence ...
openaire   +3 more sources

On Euler-Sombor index of benzenoids and phenylenes [PDF]

Kragujevac Journal of Science
The Euler-Sombor index of a graph, EU(G), is a recently introduced vertex-degree based topological index. It is derived from the geometric consideration of a graph.
Redžepović Izudin, Muminović Lejla
doaj   +1 more source

Minor-monotone crossing number [PDF]

Discrete Mathematics & Theoretical Computer Science, 2005
The minor crossing number of a graph $G$, $rmmcr(G)$, is defined as the minimum crossing number of all graphs that contain $G$ as a minor. We present some basic properties of this new minor-monotone graph invariant.
Drago Bokal, Gašper Fijavž, Bojan Mohar   +2 more
doaj   +1 more source

Comparing eccentricity-based graph invariants

Discussiones Mathematicae Graph Theory, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hua Hongbo, Wang Hongzhuan, Gutman Ivan
openaire   +3 more sources

On the ρ-Edge Stability Number of Graphs

Discussiones Mathematicae Graph Theory, 2022
For an arbitrary invariant ρ(G) of a graph G the ρ-edge stability number esρ(G) is the minimum number of edges of G whose removal results in a graph H ⊆ G with ρ(H) ≠ ρ(G) or with E(H) = ∅.
Kemnitz Arnfried, Marangio Massimiliano
doaj   +1 more source

Index maps in the K-theory of graph algebras

, 2010
Let $C^*(E)$ be the graph $C^*$-algebra associated to a graph E and let J be a gauge invariant ideal in $C^*(E)$. We compute the cyclic six-term exact sequence in $K$-theory of the associated extension in terms of the adjacency matrix associated to $E ...
Carlsen, Toke M., Eilers, Søren, Tomforde, Mark   +2 more
core   +1 more source

COLORING INVARIANTS OF SPATIAL GRAPHS [PDF]

Journal of Knot Theory and Its Ramifications, 2010
We define the fundamental quandle of a spatial graph and several invariants derived from it. In the category of graph tangles, we define an invariant based on the walks in the graph and cocycles from nonabelian quandle cohomology.
openaire   +2 more sources

Continuous Orbit Equivalence on Self-Similar Graph Actions

Mathematics, 2019
For self-similar graph actions, we show that isomorphic inverse semigroups associated to a self-similar graph action are a complete invariant for the continuous orbit equivalence of inverse semigroup actions on infinite path spaces.
Inhyeop Yi
doaj   +1 more source