
handle: 11441/33835
In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give different characterizations of when a vertex is in the center of an infinite graph and we prove that any infinite graph with at least two ends has a center.
Graph theory, ends, center, Discrete Mathematics and Combinatorics, infinite graph, Theoretical Computer Science
Graph theory, ends, center, Discrete Mathematics and Combinatorics, infinite graph, Theoretical Computer Science
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
