Results 21 to 30 of about 5,172,585 (353)

Dynamic Origin–Destination Matrix Prediction with Line Graph Neural Networks and Kalman Filter [PDF]

open access: yesTransportation 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

Line-Graph Lattices: Euclidean and Non-Euclidean Flat Bands, and Implementations in Circuit Quantum Electrodynamics [PDF]

open access: yesCommunications in Mathematical Physics, 2019
Materials science and the study of the electronic properties of solids are a major field of interest in both physics and engineering. The starting point for all such calculations is single-electron, or non-interacting, band structure calculations, and in
Alicia J. Koll'ar   +3 more
semanticscholar   +1 more source

A number theoretic problem on super line graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2016
In Bagga et al. (1995) a generalization of the line graph concept was introduced. Given a graph G with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r edges of G, with two adjacent if there is an edge in one ...
Jay Bagga, Lowell Beineke, Badri Varma
doaj   +1 more source

Outerplanarity of line graphs and iterated line graphs

open access: yesApplied Mathematics Letters, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Huiqiu   +3 more
openaire   +2 more sources

Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]

open access: yes, 2010
Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin   +2 more
core   +1 more source

The treewidth of line graphs

open access: yesJournal of Combinatorial Theory, Series B, 2018
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to determining the minimum vertex congestion of an embedding of $G$ into a tree.
Daniel J. Harvey, David R. Wood
openaire   +2 more sources

On the Representability of Line Graphs [PDF]

open access: yes, 2011
10 pages, 5 ...
Sergey Kitaev   +3 more
openaire   +4 more sources

The H-Line Signed Graph of a Signed Graph [PDF]

open access: yes, 2010
For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota   +2 more
core   +1 more source

On the Planarity of Generalized Line Graphs

open access: yesTheory and Applications of Graphs, 2019
One of the most familiar derived graphs is the line graph. The line graph $L(G)$ of a graph $G$ is that graph whose vertices are the edges of $G$ where two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in~$G$.
Khawlah H. Alhulwah   +2 more
doaj   +1 more source

Incidence matrices and line graphs of mixed graphs

open access: yesSpecial Matrices, 2023
In the theory of line graphs of undirected graphs, there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, there exists no analogous result.
Abudayah Mohammad   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy