Results 11 to 20 of about 5,992,367 (377)
Word-Representability of Line Graphs [PDF]
10 pages, 5 ...
Kitaev, Sergey+3 more
openaire +9 more sources
Characterization of Line-Consistent Signed Graphs
The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e.
Slilaty Daniel C., Zaslavsky Thomas
doaj +3 more sources
On the hardness of recognizing triangular line graphs [PDF]
Given a graph G, its triangular line graph is the graph T(G) with vertex set consisting of the edges of G and adjacencies between edges that are incident in G as well as being within a common triangle. Graphs with a representation as the triangular line graph of some graph G are triangular line graphs, which have been studied under many names including
Anand, Pranav+4 more
arxiv +7 more sources
LGESQL: Line Graph Enhanced Text-to-SQL Model with Mixed Local and Non-Local Relations [PDF]
This work aims to tackle the challenging heterogeneous graph encoding problem in the text-to-SQL task. Previous methods are typically node-centric and merely utilize different weight matrices to parameterize edge types, which 1) ignore the rich semantics
Ruisheng Cao+5 more
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 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
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
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
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, L S, Mathew, R, Sivadasan, N
openaire +3 more sources