9 search results - page 1 / 2 » Superconnectivity of bipartite digraphs and graphs |
DM
2002
13 years 7 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
DM
1999
13 years 7 months ago
1999
NETWORKS
2002
13 years 7 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...