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> 99<br />

✬<br />

A5.1<br />

A6.1<br />

A2<br />

A4.1<br />

B6.1<br />

✫<br />

A5.2<br />

A6.2<br />

B6.2<br />

B4<br />

A3<br />

Relinking patterns in p-graphs<br />

A4.2<br />

B5<br />

A6.3<br />

B6.3<br />

C6<br />

B6.4<br />

All possible relinking marriages in p-<br />

graphs with 2 to 6 vertices. Patterns are<br />

labeled as follows:<br />

• first character – number of first<br />

vertices: A – single, B – two, C<br />

– three.<br />

• second character: number of ver-<br />

tices in pattern (2, 3, 4, 5, or 6).<br />

• last character: identifier (if the two<br />

first characters are identical).<br />

Patterns denoted by A are exactly the<br />

blood marriages. In every pattern the<br />

number of first vertices equals to the<br />

number of last vertices.<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!