Results 181 to 190 of about 43,326 (227)
Some of the next articles are maybe not open access.
Canadian Mathematical Bulletin, 1966
The line - graph of an ordinary graph G is that graph whose points can be put in one-to-one correspondence with the lines of G in such a way that two points of are adjacent if and only if the corresponding lines of G are adjacent. This concept originated with Whitney [ 5 ], has the property that its (point) chromatic number equals the line chromatic
Chartrand, G., Stewart, M. J.
openaire +1 more source
The line - graph of an ordinary graph G is that graph whose points can be put in one-to-one correspondence with the lines of G in such a way that two points of are adjacent if and only if the corresponding lines of G are adjacent. This concept originated with Whitney [ 5 ], has the property that its (point) chromatic number equals the line chromatic
Chartrand, G., Stewart, M. J.
openaire +1 more source
IEEE Transactions on Cybernetics, 2019
In this paper, some efficient criteria for finite-time consensus of a class of nonsmooth opinion dynamics over a digraph are established. The lower and upper bounds on the finite settling time are obtained based respectively on the maximal and minimal ...
Xinli Shi, Jinde Cao, G. Wen, M. Perc
semanticscholar +1 more source
In this paper, some efficient criteria for finite-time consensus of a class of nonsmooth opinion dynamics over a digraph are established. The lower and upper bounds on the finite settling time are obtained based respectively on the maximal and minimal ...
Xinli Shi, Jinde Cao, G. Wen, M. Perc
semanticscholar +1 more source
Regular Digraphs Containing a Given Digraph
Canadian Mathematical Bulletin, 1984AbstractLet the maximum degree d of a digraph D be the maximum of the set of all outdegrees and indegrees of the points of D. We prove that every digraph D of order P and maximum degree d has a d-regular superdigraph H with at most d + 1 more points, and that this bound, which is independent of p, is best possible.
Harary, Frank, Karabed, Razmik
openaire +1 more source
Journal of the Franklin Institute, 2019
This paper investigates the bipartite leader-following consensus of second-order multi-agent systems with signed digraph topology. To significantly reduce the communication burden, an event-triggered control algorithm is proposed to solve the bipartite ...
J. Ren, Qiang Song, G. Lu
semanticscholar +1 more source
This paper investigates the bipartite leader-following consensus of second-order multi-agent systems with signed digraph topology. To significantly reduce the communication burden, an event-triggered control algorithm is proposed to solve the bipartite ...
J. Ren, Qiang Song, G. Lu
semanticscholar +1 more source
Bipartite synchronization of Lur'e network under signed digraph
International Journal of Robust and Nonlinear Control, 2018This paper considers the bipartite leaderless and leader‐following synchronization in a network of coupled Lur'e systems with sector‐condition node dynamics and signed digraph topology, where the interaction digraph consists of both positive and negative
F. Liu +6 more
semanticscholar +1 more source
IEEE transactions on computers, 2019
Many task models have been proposed to express and analyze the behavior of real-time applications at different levels of precision. Most of them target sequential applications with no support for parallelism.
Houssam-Eddine Zahaf +3 more
semanticscholar +1 more source
Many task models have been proposed to express and analyze the behavior of real-time applications at different levels of precision. Most of them target sequential applications with no support for parallelism.
Houssam-Eddine Zahaf +3 more
semanticscholar +1 more source
Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 2019
Many systems are recently proposed for large-scale iterative graph analytics on a single machine with GPU accelerators. Despite of many research efforts, for iterative directed graph processing over GPUs, existing solutions suffer from slow convergence speed and high data access cost, because many vertices are ineffectively reprocessed for lots of ...
Yu Zhang +5 more
openaire +1 more source
Many systems are recently proposed for large-scale iterative graph analytics on a single machine with GPU accelerators. Despite of many research efforts, for iterative directed graph processing over GPUs, existing solutions suffer from slow convergence speed and high data access cost, because many vertices are ineffectively reprocessed for lots of ...
Yu Zhang +5 more
openaire +1 more source
Canadian Journal of Mathematics, 1967
SummaryWe call a digraph “antisymmetrical” if there is an automorphismθof its graph, of period 2, which reverses the direction of every edge and maps no edge or vertex onto itself. We construct a theory of flows invariant underθfor such a diagraph. This theory is analogous to the Max Flow Min Cut theory for ordinary flows in digraphs.
openaire +2 more sources
SummaryWe call a digraph “antisymmetrical” if there is an automorphismθof its graph, of period 2, which reverses the direction of every edge and maps no edge or vertex onto itself. We construct a theory of flows invariant underθfor such a diagraph. This theory is analogous to the Max Flow Min Cut theory for ordinary flows in digraphs.
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavol Hell +3 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pavol Hell +3 more
openaire +2 more sources
1998
Abstract The underlying graph of a digraph D is the graph obtained by replacing each arc of D by the corresponding undirected edge. The converse of D is the digraph obtained by reversing the direction of each arc in D, and the complement of D is the digraph with vertex set Vin which vw is an arc if and only if it is not an arc in D.
Ronald C Read, Robin J Wilson
openaire +1 more source
Abstract The underlying graph of a digraph D is the graph obtained by replacing each arc of D by the corresponding undirected edge. The converse of D is the digraph obtained by reversing the direction of each arc in D, and the complement of D is the digraph with vertex set Vin which vw is an arc if and only if it is not an arc in D.
Ronald C Read, Robin J Wilson
openaire +1 more source