Results 21 to 30 of about 29,541 (268)
An invariant of spatial graphs [PDF]
Journal of Graph Theory, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Convolutional Neural Network Outperforms Graph Neural Network on the Spatially Variant Graph Data
Mathematics, 2023 Applying machine learning algorithms to graph-structured data has garnered significant attention in recent years due to the prevalence of inherent graph structures in real-life datasets.
Anna Boronina +2 more
doaj +1 more source
On the invariance of residues of Feynman graphs [PDF]
Journal of Mathematical Physics, 2002 We use simple iterated one-loop graphs in massless Yukawa theory and QED to pose the following question: what are the symmetries of the residues of a graph under a permutation of places to insert subdivergences. The investigation confirms partial invariance of the residue under such permutations: the highest weight transcendental is invariant under ...
Bierenbaum, Isabella +2 more
openaire +3 more sources
On the r-dynamic coloring of some fan graph families
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 In this paper, we determine the r-dynamic chromatic number of the fan graph Fm,n and determine sharp bounds of this graph invariant for four related families of graphs: The middle graph M(Fm,n), the total graph T (Fm,n), the central graph C(Fm,n) and the
Falcón Raúl M. +3 more
doaj +1 more source
The G-Invariant Graph Laplacian
, 2023 Graph Laplacian based algorithms for data lying on a manifold have been proven effective for tasks such as dimensionality reduction, clustering, and denoising. In this work, we consider data sets whose data points lie on a manifold that is closed under the action of a known unitary matrix Lie group G.
Rosen, Eitan +4 more
openaire +2 more sources
Representation of an invariant measure of irreducible discrete-time Markov chain with a finite state space by a set of opposite directed trees [PDF]
Компьютерные исследования и моделирование, 2015 A problem of finding of an invariant measure of irreducible discrete-time Markov chain with a finite state space is considered. There is a unique invariant measure for such Markov chain that can be multiplied by an arbitrary constant. A representation of
Alexej Lvovich Krugly
doaj +1 more source
Diameter-invariant graphs [PDF]
Mathematica Bohemica, 2005 Summary: The diameter of a graph \(G\) is the maximal distance between two vertices of~\(G\). A graph \(G\) is said to be diameter-edge-invariant, if \(d(G-e)=d(G)\) for all its edges, diameter-vertex-invariant, if \(d(G-v)=d(G)\) for all its vertices and diameter-adding-invariant if \(d(G+e)=d(e)\) for all edges of the complement of the edge set of ...
openaire +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 +2 more
doaj +1 more source
Homomorphisms and polynomial invariants of graphs
European Journal of Combinatorics, 2007 Junta de Andalucía P06-FQM ...
Delia Garijo +2 more
openaire +5 more sources
Invariants of Graph Drawings in the Plane [PDF]
Arnold Mathematical Journal, 2020 48 pages, many figures.
openaire +3 more sources