Betweenness-selfcentric graphs

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/15768

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.contributor	Universitat Politècnica de Catalunya. VARIDIS - Varietats Riemannianes Discretes i Teoria del Potencial
dc.contributor.author	Gago Álvarez, Silvia
dc.contributor.author	Hurajová, Jana
dc.contributor.author	Madaras, Tomas
dc.date	2012-04-11
dc.identifier.citation	Gago, S.; Hurajová, J.; Madaras, T. "Betweenness-selfcentric graphs". 2012.
dc.identifier.uri	http://hdl.handle.net/2117/15768
dc.language.iso	eng
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject	Graph theory
dc.subject	Grafs, Teoria de
dc.subject	Classificació AMS::05 Combinatorics::05C Graph theory
dc.title	Betweenness-selfcentric graphs
dc.type	info:eu-repo/semantics/draft
dc.type	info:eu-repo/semantics/report
dc.description.abstract	The betweenness centrality of a vertex of a graph is the portion of shortest paths between all pairs of vertices passing through that vertex. In this paper, we study properties and constructions of graphs whose vertices have the same value of betweenness centrality.