- FindStat

edit this statistic or download as text // json

Identifier

St001337: Graphs ⟶ ℤ

Values

([],1) => 1

([],2) => 2

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

([],3) => 3

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

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

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

([],4) => 4

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 1232 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 upper domination number of a graph.
This is the maximum cardinality of a minimal dominating set of $G$.
The smallest graph with different upper irredundance number and upper domination number has eight vertices. It is obtained from the disjoint union of two copies of $K_4$ by joining three of the four vertices of the first with three of the four vertices of the second. For bipartite graphs the two parameters always coincide [1].

References

[1] Cockayne, E. J., Favaron, O., Payan, C., Thomason, A. G. Contributions to the theory of domination, independence and irredundance in graphs MathSciNet:0602041

Code

def is_dominating(G, S):
    return set(S).union([u for v in S for u in G[v]]) == set(G.vertices())

def dominating_sets(G):
    def children(S):
        for v in S:
            S1 = S - set([v])
            if is_dominating(G, S1):
                yield S1

    R = RecursivelyEnumeratedSet([frozenset(G.vertices())], children)
    D = R.to_digraph()
    if D:
        return Poset(D).maximal_elements()
    return [frozenset(G.vertices())]


def statistic(G):
    return max(map(len, dominating_sets(G)))

Created

Dec 29, 2018 at 21:39 by Martin Rubey

Updated

Dec 30, 2018 at 00:27 by Martin Rubey