Line graphs for directed and undirected networks: An structural and analytical comparison
dc.contributor.author | Criado, R. | |
dc.contributor.author | Flores, J. | |
dc.contributor.author | Garcia del Amo, A. | |
dc.contributor.author | Romance, M. | |
dc.date.accessioned | 2011-11-14T09:04:46Z | |
dc.date.available | 2011-11-14T09:04:46Z | |
dc.date.issued | 2011-10-24 | |
dc.description.abstract | The centrality and e±ciency measures of a network G are strongly related to the respective measures on the associated line graph L(G) and bipartite graph B(G) as was shown in [8]. In this note we consider different ways to obtain a line graph from a given directed or undirected network and we obtain some interesting relations. | es |
dc.description.departamento | Matemática Aplicada | |
dc.identifier.citation | Int.J.Comp.Syst.Sci. vol.1(2), pp.100-106 (2011) | es |
dc.identifier.issn | 2174-6036 | |
dc.identifier.uri | http://hdl.handle.net/10115/5744 | |
dc.language.iso | eng | es |
dc.publisher | Yamir Moreno. Universidad Rey Juan Carlos/ Regino Criado. Universidad Rey Juan Carlos | es |
dc.rights | Atribución-NoComercial-SinDerivadas 3.0 España | * |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
dc.subject | complex networks | es |
dc.subject | dual graph | es |
dc.subject | line graph | es |
dc.subject | line digraph | es |
dc.subject.unesco | 3304.06 Arquitectura de Ordenadores | es |
dc.subject.unesco | 12 Matemáticas | es |
dc.title | Line graphs for directed and undirected networks: An structural and analytical comparison | es |
dc.type | info:eu-repo/semantics/article | es |