Results 31 to 40 of about 1,947,729 (286)

LeL-GNN: Learnable Edge Sampling and Line Based Graph Neural Network for Link Prediction

IEEE Access, 2023
Graph neural networks lose a lot of their computing power when more network layers are added. As a result, the majority of existing graph neural networks have a shallow depth of learning. Over-smoothing and information loss are two of the key issues that
Md Golam Morshed, Tangina Sultana, Young-Koo Lee   +2 more
doaj   +1 more source

Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity [PDF]

, 2013
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes our algorithm to use area \Omega(n^{1+\epsilon}) for any \epsilon>0; finding
D. Dolev, D. Eppstein, G. Tóth, H. Edelsbrunner, H. Tamaki, J.E. Goodman, J.L. Bentley, L.G. Valiant, M. Chrobak, M. Schaefer, M. Sharir, M.J. Bannister, P. Angelini, P. Bose, P. Gritzmann, P.W. Shor, R. Fulek, S. Khuller, T.L. Dey   +18 more
core   +3 more sources

BOREL LINE GRAPHS

The Journal of Symbolic Logic
Abstract We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the nine finite graphs from the classical result of Beineke together with a 10th infinite graph associated with the equivalence relation $\mathbb {E}_0$ on the Cantor space.
JAMES ANDERSON, ANTON BERNSHTEYN
openaire   +2 more sources

Generative Service Provisioning for IoT Devices Using Line Graph Structure

IEEE Access, 2023
A service subgraph helps Internet-of-Things devices access resources in a dynamic Internet-of-Things device network. We propose a service subgraph generation method for Internet-of-Things device networks.
Joohyun Kim, Jae-Hoon Kim
doaj   +1 more source

The competition number of a generalized line graph is at most two

, 2012
In 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one.
Park, Boram, Sano, Yoshio
core   +3 more sources

Outerplanarity of line graphs and iterated line graphs

Applied Mathematics Letters, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Huiqiu, Yang, Weihua, Zhang, Hailiang, Shu, Jinlong   +3 more
openaire   +2 more sources

Some Properties of Regular Line Graphs

مجلة علوم ذي قار, 2019
In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj   +4 more sources

Biomedical Interaction Prediction with Adaptive Line Graph Contrastive Learning

Mathematics, 2023
Biomedical interaction prediction is essential for the exploration of relationships between biomedical entities. Predicted biomedical interactions can help researchers with drug discovery, disease treatment, and more.
Shilin Sun, Hua Tian, Runze Wang, Zehua Zhang   +3 more
doaj   +1 more source

Randić Index of a Line Graph

Axioms, 2022
The Randić index of a graph G, denoted by R(G), is defined as the sum of 1/d(u)d(v) for all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this note, we show that R(L(T))>n4 for any tree T of order n≥3.
Jiangfu Zhang, Baoyindureng Wu
doaj   +1 more source

Walk entropies on graphs [PDF]

, 2014
Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green’s function of a graph also known as the communicability. The walk entropies are strongly
de la Peña, José A., Estrada, Ernesto, Hatano, Naomichi   +2 more
core   +1 more source