Results 41 to 50 of about 1,939,159 (235)

Tight Frame Graphs Arising as Line Graphs

The PUMP Journal of Undergraduate Research, 2021
Dual multiplicity graphs are those simple, undirected graphs that have a weighted Hermitian adjacency matrix with only two distinct eigenvalues.  From the point of view of frame theory, their characterization can be restated as which graphs have a representation by a tight frame.
Furst, Veronika, Grotts, Howard
openaire   +3 more sources

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

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

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

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

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

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

On the Representability of Line Graphs

, 2011
A graph G=(V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x,y) is in E for each x not equal to y.
Kitaev, Sergey, Salimov, Pavel, Severs, Christopher, Ulfarsson, Henning   +3 more
core   +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