Meklēšana Attēli Maps YouTube Ziņas Gmail Disks Kalendārs Vēl »
Ieiet
Grāmatas Grāmatas
" The distance between two vertices u and v is the length of a shortest path between them. The diameter of H is the maximum of the distances over all pairs of vertices, and is denoted by D{H). "
Interconnection Networks and Mapping and Scheduling Parallel Computations ... - 10. lappuse
laboja - 1995 - 342 lapas
Ierobežota priekšskatīšana - Par šo grāmatu

Mathematics of Information Processing

Michael Anshel, William Gewirtz - 1986 - 233 lapas
...connected if every pair of vertices are joined by a path. In a connected graph G , the distance <fc(u,v) between two vertices u and v is the length of a shortest path joining u and v in G. The diameter D(G) of G is the maximum value of d(i(u,v), taken over all pairs...
Ierobežota priekšskatīšana - Par šo grāmatu

Social Network Analysis: Methods and Applications

Stanley Wasserman, Stanley (University of Illinois Wasserman, Urbana-Champaign), Katherine Faust - 1994 - 825 lapas
...between two nodes is called a geodesic, and the (geodesic) distance between two nodes, denoted by d(i,j), is the length of a shortest path between them. The diameter of a graph is the length of the longest geodesic between any pair of nodes in the graph. In other words,...
Ierobežota priekšskatīšana - Par šo grāmatu

Optical Interconnections and Parallel Processing

Pascal Berthome, Alfonso Ferreira - 1998 - 393 lapas
...sequence of vertices and edges u = v 0 , E 1 , v 1 , . . . , Ek , Vk = v such that ti , v 2 } c E, for all 1 ¿ i k. The length of a path is the number...over all pairs of vertices, and is denoted by D(H). An hypergraph with maximum degree i¿, diameter D, and rank r, is called a (Lx, D, r)-hypergraph. An...
Ierobežota priekšskatīšana - Par šo grāmatu

Graph-Theoretic Concepts in Computer Science: 30th International Workshop ...

Manfred Nagl - 2004 - 404 lapas
...5 is disconnected. A moplex is a maximal clique module whose neighbourhood is a minimal separator. The distance between two vertices u and v is the length of a shortest path between u and v and is denoted d(u, v). For vertex v,ecc(v), the eccentricity of v is the length of a longest...
Ierobežota priekšskatīšana - Par šo grāmatu

Representation Theory and Complex Analysis: Lectures Given at the C.I.M.E ...

2008 - 380 lapas
...a path between any two vertices. The distance d(v, w) between vertices v and w in a connected graph is the length of a shortest path between them. The diameter of a finite connected graph is the greatest distance between any pair of vertices. The degree of a vertex...
Ierobežota priekšskatīšana - Par šo grāmatu




  1. Mana bibliotēka
  2. Palīdzība
  3. Izvērstā grāmatu meklēšana