Results 11 to 20 of about 34,352 (308)
Graph Invariant Kernels. [PDF]
, 2015 We introduce a novel kernel that upgrades the Weisfeiler-Lehman and other graph kernels to effectively exploit high dimensional and continuous vertex attributes. Graphs are first decomposed into subgraphs. Vertices of the subgraphs are then compared by a kernel that combines the similarity of their labels and the similarity of their structural role ...
Francesco Orsini +2 more
core +6 more sources
The G-Invariant Graph Laplacian [PDF]
, 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 +3 more sources
On Transmission Irregular Cubic Graphs of an Arbitrary Order
Mathematics, 2022 The transmission of a vertex v of a graph G is the sum of distances from v to all the other vertices of G. A transmission irregular graph (TI graph) has mutually distinct vertex transmissions.
Anatoly Yu. Bezhaev, Andrey A. Dobrynin
doaj +1 more source
Total Domination in Generalized Prisms and a New Domination Invariant
Discussiones Mathematicae Graph Theory, 2021 In this paper we complement recent studies on the total domination of prisms by considering generalized prisms, i.e., Cartesian products of an arbitrary graph and a complete graph.
Tepeh Aleksandra
doaj +1 more source
Mathematica Bohemica, 2004 Summary: The eccentricity \(e(v)\) of a vertex \(v\) is defined as the distance to a farthest vertex from \(v\). The radius of a graph \(G\) is defined as \(r(G)=\min _{u \in V(G)}\{ e(u)\}\). A graph \(G\) is radius-edge-invariant if \(r(G-e)=r(G)\) for every \(e \in E(G)\), radius-vertex-invariant if \(r(G-v)= r(G)\) for every \(v \in V(G)\) and ...
Bálint, V., Vaček, O.
openaire +2 more sources
Best Graph Type to Compare Discrete Groups: Bar, Dot, and Tally
Frontiers in Psychology, 2021 Different graph types might differ in group comparison due to differences in underlying graph schemas. Thus, this study examined whether graph schemas are based on perceptual features (i.e., each graph has a specific schema) or common invariant ...
Fang Zhao, Robert Gaschler
doaj +1 more source
Some Applications of Strong Product [PDF]
Mathematics Interdisciplinary Research, 2018 Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent ...
Mostafa Tavakoli +2 more
doaj +1 more source
Algorithms for computing normally hyperbolic invariant manifolds [PDF]
, 1997 An effcient algorithm is developed for the numerical computation of normally hyperbolic invariant manifolds, based on the graph transform and Newton's method.
Vegter, G., +10 more
core +1 more source
Intersection dimension and graph invariants
Discussiones Mathematicae Graph Theory, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aravind N.R., Subramanian C.R.
openaire +4 more sources
On the reconstruction of graph invariants [PDF]
Electronic Notes in Discrete Mathematics, 2009 The reconstruction conjecture has remained open for simple undirected graphs since it was suggested in 1941 by Kelly and Ulam. In an attempt to prove the conjecture, many graph invariants have been shown to be reconstructible from the vertex-deleted deck, and in particular, some prominent graph polynomials.
openaire +2 more sources