BBC

Distance-time graphs

Each line segment of a distance-time graph represents one part of a journey. A distance-time graph, sometimes referred to as a travel graph, is a way of representing a journey. It is helpful to have ...
JSTOR Daily

Degree Distance of Tensor Product and Strong Product of Graphs

Abstract.In this paper, we determine the degree distance of G× K r 0 , r 1 ,..., r n−1 and G⊠ K r 0 , r 1 ,..., r n−1 , where × and ⊠ denote the tensor product and strong product of graphs, ...
Nature

Graph Matching and Edit Distance Algorithms

Graph matching and edit distance algorithms form a cornerstone of modern computational techniques used to quantify the similarity between structured data. These methods underpin a wide array of ...
Scientific Research Publishing

V. Yegnanarayanan, “Chromatic Number of Graphs with Special Distance Sets, I,” Algebra and Discrete Mathematics, Accepted for Publication in January 2013, to appear.

ABSTRACT: An integer distance graph is a graph G(Z,D) with the set of integers as vertex set and an edge joining two vertices u andv if and only if ∣u - v∣D where D is a subset of the positive ...
Scientific Research Publishing

V. Yegnanarayanan and A. Parthiban, “The Chromatic Number of Graphs with Special Distance Sets-III,” Journal of Mathematical and Computational Science, Vol. 2, No. 5, 2012 ...

ABSTRACT: An integer distance graph is a graph G(Z,D) with the set of integers as vertex set and an edge joining two vertices u andv if and only if ∣u - v∣D where D is a subset of the positive ...
IEEE

Mahalanobis Distance-Based Graph Attention Networks

Abstract: In this paper, a Mahalanobis Distance-based Graph Attention Network for graph classification, is proposed. In contrast to traditional Graph Attention Networks, the proposed approach learns ...