Smallest graphs with distinct singleton centers

Brandes, Ulrik; Hildenbrand, Jan

Smallest graphs with distinct singleton centers

Dateien

Brandes_0-277862.pdfGröße: 319 KBDownloads: 763

Datum

2014

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

Network Science. 2014, 2(3), pp. 416-418. ISSN 2050-1242. eISSN 2050-1250. Available under: doi: 10.1017/nws.2014.25

Zusammenfassung

An incredible number of centrality indices has been proposed to date (Todeschini & Consonni, 2009). Four of them, however, can be considered prototypical because they operationalize distinct concepts of centrality and together cover the bulk of analyses and empirical uses: degree, closeness, betweenness, and eigenvector centrality.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

BRANDES, Ulrik, Jan HILDENBRAND, 2014. Smallest graphs with distinct singleton centers. In: Network Science. 2014, 2(3), pp. 416-418. ISSN 2050-1242. eISSN 2050-1250. Available under: doi: 10.1017/nws.2014.25

BibTex

@article{Brandes2014Small-30373,
  year={2014},
  doi={10.1017/nws.2014.25},
  title={Smallest graphs with distinct singleton centers},
  number={3},
  volume={2},
  issn={2050-1242},
  journal={Network Science},
  pages={416--418},
  author={Brandes, Ulrik and Hildenbrand, Jan}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/30373">
    <dc:creator>Brandes, Ulrik</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <dc:language>eng</dc:language>
    <dcterms:issued>2014</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-03-18T09:28:51Z</dcterms:available>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/30373"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Brandes, Ulrik</dc:contributor>
    <dc:creator>Hildenbrand, Jan</dc:creator>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/30373/1/Brandes_0-277862.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-03-18T09:28:51Z</dc:date>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Hildenbrand, Jan</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:title>Smallest graphs with distinct singleton centers</dcterms:title>
    <dcterms:abstract xml:lang="eng">An incredible number of centrality indices has been proposed to date (Todeschini &amp; Consonni, 2009). Four of them, however, can be considered prototypical because they operationalize distinct concepts of centrality and together cover the bulk of analyses and empirical uses: degree, closeness, betweenness, and eigenvector centrality.</dcterms:abstract>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/30373/1/Brandes_0-277862.pdf"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja