Definition:
A graph $G$ is called well-covered if all minimal vertex covers of $G$ have
the same
number of elements.
What is the coding to check well-covered graph?
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this
ertices in G.
>
> G.subgraph_search_iterator(graphs.PathGraph(k+1),induced=True)
>
> More on this may be found at [1].
>
> [1];
> http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/generic_graph.html#sage.graphs.generic_graph.GenericGraph.subgraph_search_iterator
>
> On Thursday, July 27,
Let $G$ be a finite simple graph.
Can we find all paths(induced ) of given length?
Thanks in advance.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
