- FindStat

edit this statistic or download as text // json

Identifier

St001335: Graphs ⟶ ℤ

Values

([],0) => 0

([],1) => 0

([],2) => 0

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

([],3) => 0

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

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

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

([],4) => 0

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

>>> Load all 1626 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 cardinality of a minimal cycle-isolating set of a graph.
Let $\mathcal F$ be a set of graphs. A set of vertices $S$ is $\mathcal F$-isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of $S$ does not contain any graph in $\mathcal F$.
This statistic returns the cardinality of the smallest isolating set when $\mathcal F$ contains all cycles.

References

[1] Caro, Y., Hansberg, A. Partial domination - the isolation number of a graph arXiv:1504.08055

Code

def isolating_set_cardinality(G, lF):
    V = G.vertices()
    for k in range(G.num_verts()+1):
        for D in Subsets(V, k):
            N = set(D).union(*[set(G[v]) for v in D])
            H = G.subgraph([v for v in V if v not in N])
            if not any(H.subgraph_search(F) for F in lF):
                return k
            
def statistic(G):
    return isolating_set_cardinality(G, [graphs.CycleGraph(m) for m in range(3, G.num_verts()+1)])

Created

Dec 26, 2018 at 16:40 by Martin Rubey

Updated

Jan 27, 2021 at 12:10 by Martin Rubey