16.11.2012 Views

'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj

'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj

'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

V. <strong>Batagelj</strong>: <strong>Analysis</strong> and visulization of large networks with <strong>Pajek</strong> 42<br />

✬<br />

✫<br />

Subgraph<br />

A subgraph H = (V ′ , L ′ ) of a given graph G = (V, L) is a graph which set of lines<br />

is a subset of set of lines of G, L ′ ⊆ L, its vertex set is a subset of set of vertices of<br />

G, V ′ ⊆ V, and it contains all end-vertices of L ′ .<br />

A subgraph can be induced by a given subset of vertices or lines. It is a spanning<br />

subgraph iff V ′ = V.<br />

Methodenforum der Fakultät für Sozialwissenschaften, Universität Wien, 21-22. 6. 2007 ▲<br />

❙ ▲<br />

▲<br />

● ❙ ▲<br />

▲<br />

☛ ✖<br />

▲<br />

✩<br />

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!