In this paper, a graph-theory-based approach for representing planar mechanisms is presented, the Santiago Portilla method (SPM). From the corresponding adjacency matrix, SPM generates an extended ...

In the present paper, we extend these results by incorporating a diagonal matrix D, which contains the degree of each vertex of the considered graph along its diagonal and which we refer to as the ...

1. Representation limitation: A comprehensive representation enables matching from multiple perspectives. Most methods only use simple node embeddings without highlighting the edge representation, ...

The main outcome of the HodgeRank is a graph, analogous to an electric circuit, from which some structural elements of the representation can already be identified. Moreover, the HodgeRank technique ...

The dynamic graphs (Kazemi et al., 2020) model the entire graph as a collection of graphs under distinct time snapshots. As a result, dynamic graphs are able to accurately explain the structural and ...

The essence of connection in vehicle network is the social relationship between people, and thus Vehicular Social Networks (VSNs), characterized by social aspects and features, can be formed. The ...

ABSTRACT: A ring R is called right principally quasi-Baer (simply, right p.q.-Baer) if the right annihilator of every principal right ideal of R is generated by an idempotent. For a ring R, let G be a ...