'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj
'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj
'Advanced Network Analysis / Pajek: Large ... - Vladimir Batagelj
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
V. <strong>Batagelj</strong>: <strong>Analysis</strong> and visulization of large networks with <strong>Pajek</strong> 54<br />
✬<br />
✫<br />
Properties of cores<br />
From the figure, representing 0, 1, 2 and 3 core, we can see the following<br />
properties of cores:<br />
• The cores are nested: i < j =⇒ Hj ⊆ Hi<br />
• Cores are not necessarily connected subgraphs.<br />
An efficient algorithm for determining the cores hierarchy is based on the<br />
following property:<br />
If from a given graph G = (V, E) we recursively delete all vertices,<br />
and edges incident with them, of degree less than k, the remaining<br />
graph is the k-core.<br />
For details see the paper.<br />
Methodenforum der Fakultät für Sozialwissenschaften, Universität Wien, 21-22. 6. 2007 ▲<br />
❙ ▲<br />
▲<br />
▲<br />
● ❙ ▲<br />
▲<br />
☛ ✖<br />
✩<br />
✪