Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/774
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEGGHE, Leo-
dc.contributor.authorROUSSEAU, Ronald-
dc.date.accessioned2005-05-26T07:40:12Z-
dc.date.available2005-05-26T07:40:12Z-
dc.date.issued2003-
dc.identifier.citationMathematical and Computer Modelling, 37(7-8). p. 879-899-
dc.identifier.issn0895-7177-
dc.identifier.urihttp://hdl.handle.net/1942/774-
dc.description.abstractCompactness as introduced by Botafogo, Rivlin and Shneiderman, in short: BRS-compactness, is studied in general, as it can be used to describe the cohesion of parts of the internet or collaboration networks, and in the particular case of a unidirectional network, such as a citation graph. It is shown that the connection coefficient is an upper bound for the BRS-compactness value of a network. During our investigations, we derive an upper bound for the generalized Wiener index of a directed graph. Several networks are constructed and their BRS-compactness values are calculated.-
dc.format.extent750516 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherElsevier-
dc.subject.otherBRS-compactness; networks; hyperlinks; Internet; citation networks; collaboration graphs; generalized Wiener index; sum of distances in a graph-
dc.titleBRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet-
dc.typeJournal Contribution-
dc.identifier.epage899-
dc.identifier.issue7-8-
dc.identifier.spage879-
dc.identifier.volume37-
local.bibliographicCitation.jcatA1-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcatA1-
dc.identifier.doi10.1016/S0895-7177(03)00091-8-
dc.identifier.isi000183196800019-
item.contributorEGGHE, Leo-
item.contributorROUSSEAU, Ronald-
item.fullcitationEGGHE, Leo & ROUSSEAU, Ronald (2003) BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet. In: Mathematical and Computer Modelling, 37(7-8). p. 879-899.-
item.accessRightsOpen Access-
item.fulltextWith Fulltext-
item.validationecoom 2004-
crisitem.journal.issn0895-7177-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
brscompactness.pdfNon Peer-reviewed author version732.93 kBAdobe PDFView/Open
brs 1.pdfPublished version1.37 MBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.