Results 11 to 20 of about 5,977,266 (359)
Line Graph Neural Networks for Link Weight Prediction [PDF]
In real-world networks, predicting the weight (strength) of links is as crucial as predicting the existence of the links themselves. Previous studies have primarily used shallow graph features for link weight prediction, limiting the prediction ...
Jinbi Liang, Cunlai Pu
semanticscholar +1 more source
Line Graph Contrastive Learning for Link Prediction [PDF]
Link prediction tasks focus on predicting possible future connections. Most existing researches measure the likelihood of links by different similarity scores on node pairs and predict links between nodes.
Zehua Zhang+3 more
semanticscholar +1 more source
Orbital design of flat bands in non-line-graph lattices via line-graph wave functions [PDF]
Line-graph (LG) lattices are known for having flat bands (FBs) from the destructive interference of Bloch wavefunctions encoded in pure lattice symmetry.
Hang Liu+3 more
semanticscholar +1 more source
Line graph characterization of power graphs of finite nilpotent groups [PDF]
This paper deals with the classification of groups G such that power graphs and proper power graphs of G are line graphs. In fact, we classify all finite nilpotent groups whose power graphs are line graphs. Also, we categorize all finite nilpotent groups
S. Bera
semanticscholar +1 more source
New results and open problems in line graphs
Given a graph G with at least one edge, the line graph L(G) is that graph whose vertices are the edges of G, with two of these vertices being adjacent if the corresponding edges are adjacent in G.
Jay Bagga, Lowell Beineke
doaj +1 more source
Line Graph Neural Networks for Link Prediction [PDF]
We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. With the advances of deep learning, current link prediction methods commonly compute features from subgraphs centered at two ...
Lei Cai+3 more
semanticscholar +1 more source
Graph schema and best graph type to compare discrete groups: Bar, line, and pie
Different graph types may differ in their suitability to support group comparisons, due to the underlying graph schemas. This study examined whether graph schemas are based on perceptual features (i.e., each graph type, e.g., bar or line graph, has its ...
Fang Zhao, Robert Gaschler
doaj +1 more source
Independent point-set domination in line graphs
Line graph of a graph G is an intersection graph of the edge set E(G) of G. In this paper, we obtain a sharp upper bound on the diameter of graph G whose line graph is an ipsd graph (graph possessing an independent point-set dominating set) by ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj +1 more source
Boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper, we show that for a line graph G of a multigraph, box(G) <= 2 (\lceil log_2(log_2( )) \rceil + 3) + 1, where denotes the maximum degree of G. Since <= 2( - 1), for any line graph
Chandran, Sunil L+2 more
openaire +3 more sources
An Even 2-Factor in the Line Graph of a Cubic Graph
An even 2-factor is one such that each cycle is of even length. A 4- regular graph G is 4-edge-colorable if and only if G has two edge-disjoint even 2- factors whose union contains all edges in G.
SeungJae Eom, Kenta Ozeki
doaj +1 more source