- FindStat

edit this statistic or download as text // json

Identifier

St000916: Graphs ⟶ ℤ

Values

([],1) => 1

([],2) => 2

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

([],3) => 3

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

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

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

([],4) => 4

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

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

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

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

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

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

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

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

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

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

([],5) => 5

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

([(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) => 3

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

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

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

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

([(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) => 2

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

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

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

([(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) => 1

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

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

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

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

([(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) => 1

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

([(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) => 2

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

([(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) => 1

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

([(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) => 1

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

([],6) => 6

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

([(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) => 4

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

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

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

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

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

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

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

([(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) => 3

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

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

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

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

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

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

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

([(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) => 2

([(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) => 2

([(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) => 2

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

([(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) => 1

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

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

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

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

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

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

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

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

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

([(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) => 2

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

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

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

>>> 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 packing number of a graph.
This is the size of a largest subset of vertices of a graph, such that any two distinct vertices in the subset have disjoint closed neighbourhoods, or, equivalently, have distance greater than two.

References

[1] Meir, A., Moon, J. W. Relations between packing and covering numbers of a tree MathSciNet:0401519
[2] Mojdeh, D. A., Samadi, B., Khodkar, A., Golmohammadi, H. R. On the packing numbers in graphs arXiv:1707.08656

Code

def statistic(G):
    for l in range(G.num_verts(), -1, -1):
        for B in Subsets(G.vertices(), l):
            if all(set(G[u]+[u]).isdisjoint(G[v]+[v]) for u, v in Subsets(B, 2)):
                return l

Created

Jul 28, 2017 at 05:58 by Martin Rubey

Updated

Aug 03, 2017 at 14:49 by Martin Rubey