Results 11 to 20 of about 6,540,046 (323)
New results and open problems in line graphs
AKCE International Journal of Graphs and Combinatorics, 2022 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]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2020 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
Frontiers in Psychology, 2022 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
Line Graphs of Monogenic Semigroup Graphs
Journal of Mathematics, 2021 The concept of monogenic semigroup graphs Γ S M
Nihat Akgunes +2 more
openaire +2 more sources
Independent point-set domination in line graphs
AKCE International Journal of Graphs and Combinatorics, 2021 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
An Even 2-Factor in the Line Graph of a Cubic Graph
Theory and Applications of Graphs, 2022 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
A result on Hamiltonian line graphs involving restrictions on induced subgraphs [PDF]
, 1988 It is shown that the existence of a Hamilton cycle in the line graph of a graph G can be ensured by imposing certain restrictions on certain induced subgraphs of G.
Benhocine +11 more
core +8 more sources
Omega Index of Line and Total Graphs
Journal of Mathematics, 2021 A derived graph is a graph obtained from a given graph according to some predetermined rules. Two of the most frequently used derived graphs are the line graph and the total graph.
Musa Demirci +3 more
doaj +1 more source
Dynamic Origin–Destination Matrix Prediction with Line Graph Neural Networks and Kalman Filter [PDF]
Transportation Research Record, 2019 Modern intelligent transportation systems provide data that allow real-time dynamic demand prediction, which is essential for planning and operations.
Xincheng Xiong +3 more
semanticscholar +1 more source
Every $3$-connected, essentially $11$-connected line graph is hamiltonian [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Thomassen conjectured that every $4$-connected line graph is hamiltonian. A vertex cut $X$ of $G$ is essential if $G-X$ has at least two nontrivial components. We prove that every $3$-connected, essentially $11$-connected line graph is hamiltonian. Using
Hong-Jian Lai +3 more
doaj +1 more source