Results 31 to 40 of about 415,143 (70)

Open Distance-Pattern Uniform Graphs [PDF]

, 2009
All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6].
Jose, Bibin K.
core   +1 more source

Smarandachely t-path step signed graphs [PDF]

, 2010
Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed ...
Reddy, Siva Kota, Prashanth , B., V. Lokesha, Lokesha, V., P. Siva Kota Reddy, B. Prashanth   +5 more
core   +1 more source

Sequences on Graphs with Symmetries [PDF]

, 2011
An interesting symmetry on multiplication of numbers found by Prof.Smarandache recently. By considering integers or elements in groups on graphs, we extend this symmetry on graphs and find geometrical symmetries.
Mao, Linfan, Linfan Mao
core   +1 more source

THGNN: Temporal Heterophilic Graph Neural Network for Event-based Graph [PDF]

The present disclosure proposes techniques (e.g., a method and a system) for generating temporal heterophilic graph neural network (THGNN) for event-based graphs. All existing (temporal) GNNs typically follow temporal homophily assumption, while the real-
CHEN, HUIYUAN, Visa, DAS, MAHASHWETA, Visa, CHEN, YUZHONG, Visa, LI, XIAOTING, Visa, YAN, YUCHEN, Visa   +4 more
core   +1 more source

Knot Graphs [PDF]

, 2000
We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph which is reducible by some finite sequence of these moves, to a graph with no edges is called a knot graph.
Welsh, D J A, Noble, Steven, Bollobs, B, Cooper, C., Frieze, A. M., Fenner, T. I., Frieze, A.M., Welsh, D.J.A., Cooper, C, Frieze, A M, Bollobas, B., Fenner, T I, Fenner, Trevor, Noble, S D   +13 more
core   +1 more source

THeGCN: Temporal Heterophilic Graph Convolutional Network

Graph Neural Networks (GNNs) have exhibited remarkable efficacy in diverse graph learning tasks, particularly on static homophilic graphs. Recent attention has pivoted towards more intricate structures, encompassing (1) static heterophilic graphs ...
Xu, Zhe, Tong, Hanghang, Yan, Yuchen, Liu, Zhining, Liu, Lihui, Li, Xiaoting, Chen, Huiyuan, Chen, Yuzhong, Zeng, Zhichen   +8 more
core   +4 more sources

High-Order Recommendation with Heterophilic Hypergraph Diffusion

Collaborative Filtering (CF) is a crucial task in recommendation systems, aimed at predicting user preferences based on the behaviors and preferences of similar users.
Sakong, Darnbi, Sakong, D, Huynh, Thanh Trung, Jo, J, Huynh, TT, Jo, Jun   +5 more
core   +1 more source

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]

Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core  

Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs

Graph Neural Networks (GNNs) have gained significant attention as a powerful modeling and inference method, especially for homophilic graph-structured data.
Liang, L, Xu, Z, Kim, S, Qi, Y, Shin, K, Pan, S   +5 more
core  

On some metric properties of supertoken graphs

In this paper, we construct two infinite families of graphs and , where, in both cases, a vertex label is with . We provide a tight lower bound on the metric dimension of .
Baskoro, Edy Tri, Simanjuntak, Rinovia, Dalfó Simó, Cristina, Fiol Mora, Miquel Àngel   +3 more
core   +1 more source