Results 191 to 200 of about 8,697 (224)

Neighborhood Shocks and Network Dynamics: An Instrumental Variable Approach to Measuring Triadic Closure in Daily Mobility Networks. [PDF]

Soc Networks
Vachuska K, Adamson C.
europepmc   +1 more source

Rainbow connections of bioriented graphs. [PDF]

Heliyon
Wang L, Liu S, Jiang H.
europepmc   +1 more source

Some novel concepts of intuitionistic fuzzy directed graphs with application in selecting a suitable place for opening restaurant. [PDF]

Heliyon
Khan WA, Ali K, Fida A, Asif M, Pham HV, Nguyen QH, Le TT, Tran LPT.   +7 more
europepmc   +1 more source

Game Theoretic Clustering for Finding Strong Communities. [PDF]

Entropy (Basel)
Zhao C, Al-Bashabsheh A, Chan C.
europepmc   +1 more source

Line Digraph Iterations and the (d, k) Digraph Problem

IEEE Transactions on Computers, 1984
This paper studies the behavior of the diameter and the average distance between vertices of the line digraph of a given digraph. The results obtained are then applied to the so-called (d, k) digraph problem, that is, to maximize the number of ...
Fiol Mora, Miquel Àngel, Alegre de Miguel, Ignacio, Andrés Yebra, José Luis   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Homology of Digraphs

Mathematical Notes, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grigoryan, Alexander, Muranov, Yu. V., Jimenez, R.   +2 more
openaire   +1 more source

Perfect Digraphs

Journal of Graph Theory, 2014
AbstractThe clique number of a digraph D is the size of the largest bidirectionally complete subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number defined by Neumann‐Lara (The dichromatic number of a digraph, J. Combin. Theory Ser. B 33 (1982), 265–270) equals the clique number .
Stephan Dominique Andres, Winfried Hochstättler   +1 more
openaire   +3 more sources

Regular Digraphs Containing a Given Digraph

Canadian Mathematical Bulletin, 1984
AbstractLet 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

On super‐edge‐connected digraphs and bipartite digraphs

Journal of Graph Theory, 1992
AbstractA maximally edge‐connected digraph is called super‐λ if every minimum edge disconnecting set is trivial, i.e., it consists of the edges adjacent to or from a given vertex. In this paper sufficient conditions for a digraph to be super‐λ are presented in terms of parameters such as diameter and minimum degree.
openaire   +3 more sources

CKI-Digraphs, Generalized Sums and Partitions of Digraphs

Graphs and Combinatorics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hortensia Galeana-Sánchez, Mika Olsen
openaire   +2 more sources