lobby: Find the lobby index (centrality)
In centiserve: Find Graph Centrality Indices

Description Usage Arguments Details Value Author(s) References Examples

The l-index or lobby index of a node x is the largest integer k such that x has at least k neighbors with a degree of at least k.

1	lobby(graph, vids = V(graph), mode = c("all", "out", "in"), loops = TRUE)

`graph`	The input graph as igraph object
`vids`	Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices.
`mode`	Character constatnt, it specifies how to use the direction of the edges if a directed graph is analyzed. For 'out' only the outgoing edges are followed. For 'in' all vertices from which the source vertex is reachable in at most order steps are counted. 'all' ignores the direction of the edges. This argument is ignored for undirected graphs.
`loops`	Logical; whether the loop edges are also counted.

For more detail at Lobby Index

A numeric vector contaning the centrality scores for the selected vertices.

Mahdi Jalili m_jalili@farabi.tums.ac.ir

Korn, A., A. Schubert, and A. Telcs. "Lobby index in networks." Physica A: Statistical Mechanics and its Applications 388.11 (2009): 2221-2226.

1 2	g <- random.graph.game(20, 3/10) lobby(g)

Loading required package: igraph

Attaching package: 'igraph'

The following objects are masked from 'package:stats':

    decompose, spectrum

The following object is masked from 'package:base':

    union

Loading required package: Matrix
 [1] 5 5 5 5 4 6 5 5 5 5 6 6 5 6 5 6 2 5 5 5