Graph meta learning aims to learn historical knowledge from training graph neural networks (GNNs) models and adapt it downstream tasks in a target graph, which has drawn increasing attention due its ability of transfer fast adaptation. While existing approaches assume the are same domain but lack solution for multi-domain In this paper, we address generalized problem, is challenging non-Euclide...

Abstract After more than one decade, Weisfeiler-Lehman graph kernels are still among the most prevalent due to their remarkable predictive performance and time complexity. They based on a fast iterative partitioning of vertices, originally designed for deciding isomorphism with one-sided error. The retain this idea compare such labels respect equality. This binary valued comparison is, however,...

let g be a simple connected graph. the generalized polarity wiener index ofg is defined as the number of unordered pairs of vertices of g whosedistance is k. some formulas are obtained for computing the generalizedpolarity wiener index of the cartesian product and the tensor product ofgraphs in this article.

PRISM (Parameter-elevation Regressions on Independent Slopes Model) is a climate analysis system that uses point data, a digital elevation model (DEM), and other spatial datasets to generate gridded estimates of annual, monthly and event-based climatic parameters (Daly et al. 1994). Originally developed in 1991 for precipitation estimation, PRISM has been generalized and applied successfully to...

Given a graph G, a function f : V (G)→ {1, 2, ..., k} is a k-biranking of G if f(u) = f(v) implies every u-v path contains vertices x and y such that f(x) > f(u) and f(y) < f(u). The birank number of a graph, denoted bi(G), is the minimum k such that G has a k-biranking. In this paper we determine the birank numbers for ladder, prism, and Möbius ladder graphs.

This paper investigates the following question: Given a grid φ, where φ is a proper subset of the integer 2D or 3D grid, which graphs admit straight-line crossing-free drawings with vertices located at (integral) grid points of φ? We characterize the trees that can be drawn on a strip, i.e., on a two-dimensional n × 2 grid. For arbitrary graphs we prove lower bounds for the height k of an n × k...