Betweenness Centralization for Bipartite Graphs
Bibliographic Data
| ID | 10142573 |
|---|---|
| Authors | Philip Sinclair (corresponding author) |
| Year | 2004 |
| Volume | 29 |
| Issue | 1 |
| Pages | 25-31 |
| Publication date | 2004-12-30 |
| Peer Reviewed | Yes |
| Open Access | No |
| Type | ARTICLE |
| Venue | Journal of Mathematical Sociology (JOURNAL) |
| Journal identifiers | ISSN: 0022-250X • E-ISSN: 1545-5874 |
| Publisher | Taylor & Francis (PUBLISHER • GB) |
| DOI | 10.1080/00222500590889730 |
| OpenAlex | W2074118146 |
| Language | EN |
| Citations received | 2 |
| References cited | 3 |
A previously conjectured result, from Everett, Sinclair and Dankelmann (2004), on the upper bound for a centralization index in bipartite graphs, when used with the betweenness index of vertex centrality, is proved
Betweenness centrality · Bipartite graph · Combinatorics · Computer network · Graph · Advanced Graph Theory Research · Complex Network Analysis Techniques · Computer Science · Graph theory and applications · Mathematics · Theoretical Computer Science
| Unique citing works | 2 |
|---|---|
| Citations per year | 0.2 |
| Citation span | 2016 - 2020 (5) |
| Citation velocity | historical |
| Highly cited | No |
| Citation types | Neutral: 2 |