Results 41 to 50 of about 1,946,730 (334)
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
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
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 +3 more
core +2 more sources
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 +18 more
core +3 more sources
Discrete Mathematics, 2011 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 +4 more sources
On chordal graph and line graph squares [PDF]
Discrete Applied Mathematics, 2018 In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize the chordality of graph squares by forbidden subgraphs.
Robert Scheidweiler +1 more
openaire +2 more sources
On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions [PDF]
, 2017 In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph whose line graph ...
Bryant, Darryn +2 more
core +1 more source
Scattering theory and discrete-time quantum walks
, 2004 We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each.
Ambainis +21 more
core +1 more source
Morphing Planar Graph Drawings Optimally [PDF]
, 2014 We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound.
C. Erten +10 more
core +1 more source
Graph Equation for Line Graphs and m-Step Graphs [PDF]
Graphs and Combinatorics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, Seog-Jin +4 more
openaire +1 more source