Results 101 to 110 of about 5,251,465 (203)
Average tree solutions for graph games [PDF]
In this paper we consider cooperative graph games being TU-games in which players cooperate if they are connected in the communication graph. We focus our attention to the average tree solutions introduced by Herings, van der Laan and Talman [6] and ...
Remila, Eric +3 more
core
Perfect Set of Euler Tours of Kp,p,p
Discussiones Mathematicae Graph Theory, 2016 Bermond conjectured that if G is Hamilton cycle decomposable, then L(G), the line graph of G, is Hamilton cycle decomposable. In this paper, we construct a perfect set of Euler tours for the complete tripartite graph Kp,p,p for any prime p and hence ...
Govindan T., Muthusamy A.
doaj +1 more source
SALBPGen - A systematic data generator for (simple) assembly line balancing [PDF]
Assembly line balancing is a well-known and extensively researched decision problem which arises when assembly line production systems are designed and operated.
Christian Otto, Alena Otto, Armin Scholl
core
Morphing Planar Graph Drawings Efficiently
, 2013 A morph between two straight-line planar drawings of the same graph is a continuous transformation from the first to the second drawing such that planarity is preserved at all times.
Vincenzo Roselli +7 more
core +1 more source
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
, 2016 Thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. Thomassen, Rectilinear drawings of graphs,
Seok-Hee Hong +3 more
core +1 more source
On the critical lines of a graph [PDF]
Pacific Journal of Mathematics, 1967 Beineke, Lowell W. +2 more
openaire +2 more sources
On the Line Graph of the Complete Bipartite Graph
The Annals of Mathematical Statistics, 1964 In an interesting recent article [4], J. W. Moon has given a list of properties of the graph $L(B_{mn})$ (to be defined more precisely below) and investigated the question of whether these properties characterize the graph. In case $m = n$, this question had been settled by Shrikhande [5] (see also [1], [2] and [3]), who proved that the answer was yes ...
openaire +3 more sources
Steiner radial number resulting from various graph operations
Electronic Journal of Graph Theory and ApplicationsThe Steiner n-radial graph of a graph G on p vertices, denoted by SRn(G), has the vertex set as in G and any n(2 ≤ n ≤ p) vertices are mutually adjacent in SRn(G) if and only if they are n-radial in G.
R. Gurusamy +3 more
doaj +1 more source
Action planning for graph transition systems [PDF]
, 2005 Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution.
Lluch-Lafuente, Alberto +5 more
core +1 more source
Line-Graph Qubit Routing [PDF]
One limitation of current quantum hardware is the restricted connectivity between qubits, as described by the hardware’s coupling graph. To overcome this limitation, efficient qubit routing strategies are necessary. We introduce line-graph qubit routing,
Hariharan, S. (Seenivasan) +3 more
core +1 more source