- FindStat

edit this statistic or download as text // json

Identifier

St001691: Graphs ⟶ ℤ

Values

([],1) => 1

([],2) => 2

([(0,1)],2) => 0

([],3) => 3

([(1,2)],3) => 1

([(0,2),(1,2)],3) => 1

([(0,1),(0,2),(1,2)],3) => 0

([],4) => 4

([(2,3)],4) => 2

([(1,3),(2,3)],4) => 2

([(0,3),(1,3),(2,3)],4) => 1

([(0,3),(1,2)],4) => 0

([(0,3),(1,2),(2,3)],4) => 0

([(1,2),(1,3),(2,3)],4) => 1

([(0,3),(1,2),(1,3),(2,3)],4) => 1

([(0,2),(0,3),(1,2),(1,3)],4) => 0

([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 0

([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 0

([],5) => 5

([(3,4)],5) => 3

([(2,4),(3,4)],5) => 3

([(1,4),(2,4),(3,4)],5) => 2

([(0,4),(1,4),(2,4),(3,4)],5) => 1

([(1,4),(2,3)],5) => 1

([(1,4),(2,3),(3,4)],5) => 1

([(0,1),(2,4),(3,4)],5) => 1

([(2,3),(2,4),(3,4)],5) => 2

([(0,4),(1,4),(2,3),(3,4)],5) => 1

([(1,4),(2,3),(2,4),(3,4)],5) => 2

([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 1

([(1,3),(1,4),(2,3),(2,4)],5) => 1

([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => 1

([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1

([(0,4),(1,3),(2,3),(2,4),(3,4)],5) => 0

([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1

([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5) => 2

([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0

([(0,4),(1,3),(2,3),(2,4)],5) => 0

([(0,1),(2,3),(2,4),(3,4)],5) => 0

([(0,3),(1,2),(1,4),(2,4),(3,4)],5) => 1

([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5) => 1

([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => 0

([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5) => 0

([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5) => 1

([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5) => 0

([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1

([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1

([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0

([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5) => 0

([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5) => 1

([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0

([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 0

([],6) => 6

([(4,5)],6) => 4

([(3,5),(4,5)],6) => 4

([(2,5),(3,5),(4,5)],6) => 3

([(1,5),(2,5),(3,5),(4,5)],6) => 2

([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 1

([(2,5),(3,4)],6) => 2

([(2,5),(3,4),(4,5)],6) => 2

([(1,2),(3,5),(4,5)],6) => 2

([(3,4),(3,5),(4,5)],6) => 3

([(1,5),(2,5),(3,4),(4,5)],6) => 2

([(0,1),(2,5),(3,5),(4,5)],6) => 1

([(2,5),(3,4),(3,5),(4,5)],6) => 3

([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 1

([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 2

([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 1

([(2,4),(2,5),(3,4),(3,5)],6) => 2

([(0,5),(1,5),(2,4),(3,4)],6) => 2

([(1,5),(2,3),(2,4),(3,5),(4,5)],6) => 2

([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => 1

([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2

([(1,5),(2,4),(3,4),(3,5),(4,5)],6) => 1

([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => 0

([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6) => 1

([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2

([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => 1

([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1

([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => 3

([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6) => 2

([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => 2

([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1

([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1

([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => 2

([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 0

([(0,5),(1,4),(2,3)],6) => 0

([(1,5),(2,4),(3,4),(3,5)],6) => 1

([(0,1),(2,5),(3,4),(4,5)],6) => 0

([(1,2),(3,4),(3,5),(4,5)],6) => 1

([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => 1

([(1,4),(2,3),(2,5),(3,5),(4,5)],6) => 2

([(0,1),(2,5),(3,4),(3,5),(4,5)],6) => 1

([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 1

([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 2

([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 1

([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => 1

([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6) => 0

([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => 1

([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6) => 1

>>> Load all 1200 entries. <<<

search for individual values

searching the database for the individual values of this statistic

/ search for generating function

searching the database for statistics with the same generating function

click to show known generating functions

Description

The number of kings in a graph.
A vertex of a graph is a king, if all its neighbours have smaller degree. In particular, an isolated vertex is a king.

References

[1] van der Zypen, D. Are at most $1/3$ vertices "kings"? MathOverflow:385167

Code

def statistic(G):
    return sum(1 for v in G if all(G.degree(v) > G.degree(u) for u in G[v]))

Created

Feb 28, 2021 at 21:55 by Martin Rubey

Updated

Feb 28, 2021 at 21:55 by Martin Rubey