Suppose we have a graph $G(V,E)$
What is the number of independent sets in graph of this type?
I have an idea to use reccurence $$|G|=|G\backslash \{v\}|+|G\backslash n(v)|$$ where $|G|$ is the number all possible independent sets of graph G, $v$ is an arbitrary vertex, and $n(v)$ is a set of all vertex's joined toadjacent with $v$ and $v$ itself.
But may be there some better ideas or results?
Suppose we have a graph $G(V,E)$
What is the number of independent sets in graph of this type?
I have an idea to use reccurence $$|G|=|G\backslash \{v\}|+|G\backslash n(v)|$$ where $|G|$ is the number all possible independent sets of graph G, $v$ is an arbitrary vertex, and $n(v)$ is a set of all vertex's joined to $v$ and $v$ itself.
But may be there some better ideas or results?
Suppose we have a graph $G(V,E)$
What is the number of independent sets in graph of this type?
I have an idea to use reccurence $$|G|=|G\backslash \{v\}|+|G\backslash n(v)|$$ where $|G|$ is the number all possible independent sets of graph G, $v$ is an arbitrary vertex, and $n(v)$ is a set of all vertex's adjacent with $v$ and $v$ itself.
But may be there some better ideas or results?
Suppose we have a graph $G(V,E)$
What is the number of independent sets in graph of this type?
I have an idea to use reccurence $$|G|=|G\backslash \{v\}|+|G\backslash n(v)|$$ where $|G|$ is the number all possible independent sets of graph G, $v$ is an arbitrary vertex, and $n(v)$ is a set of all vertex's joined to $v$ and $v$ itself.
But may be there some better ideas or results?
Suppose we have a graph $G(V,E)$
What is the number of independent sets in graph of this type?
I have an idea to use reccurence $$|G|=|G\backslash \{v\}|+|G\backslash n(v)|$$ where $|G|$ is the number all possible independent sets of graph G, $v$ is an arbitrary vertex, and $n(v)$ is a set of all vertex's joined to $v$ and $v$ itself.
But may be there some better ideas or results?
Suppose we have a graph $G(V,E)$
What is the number of independent sets in graph of this type?
I have an idea to use reccurence $$|G|=|G\backslash \{v\}|+|G\backslash n(v)|$$ where $|G|$ is the number all possible independent sets of graph G, $v$ is an arbitrary vertex, and $n(v)$ is a set of all vertex's joined to $v$ and $v$ itself.
But may be there some better ideas or results?
Suppose we have a graph $G(V,E)$ and we can colour some vertex's in black.
Colouring is called tolerant if no two joined (by edge) vertex's are coloured both.
Is there algorithm or formula of estimatingWhat is the number of all possible tolerant colourings of certainindependent sets in graph of this type?
Actualy i need to do it for such graph
I have an idea to use reccurence $$|G|=|G\backslash \{v\}|+|G\backslash n(v)|$$ where $|G|$ is the number all possible tollerant colouringsindependent sets of graph G, $v$ is an arbitrary vertex, and $n(v)$ is a set of all vertex's joined to $v$ and $v$ itself.
But may be there some better ideas or results?
Suppose we have a graph $G(V,E)$ and we can colour some vertex's in black.
Colouring is called tolerant if no two joined (by edge) vertex's are coloured both.
Is there algorithm or formula of estimating number of all possible tolerant colourings of certain graph?
Actualy i need to do it for such graph
I have an idea to use reccurence $$|G|=|G\backslash \{v\}|+|G\backslash n(v)|$$ where $|G|$ is the number all possible tollerant colourings of graph G, $v$ is an arbitrary vertex, and $n(v)$ is a set of all vertex's joined to $v$ and $v$ itself.
But may be there some better ideas or results?
Suppose we have a graph $G(V,E)$
What is the number of independent sets in graph of this type?
I have an idea to use reccurence $$|G|=|G\backslash \{v\}|+|G\backslash n(v)|$$ where $|G|$ is the number all possible independent sets of graph G, $v$ is an arbitrary vertex, and $n(v)$ is a set of all vertex's joined to $v$ and $v$ itself.
But may be there some better ideas or results?
