#19985: Add is_partial_cube
-------------------------------------+-------------------------------------
Reporter: jaanos | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.1
Component: graph theory | Resolution:
Keywords: graphs partial | Merged in:
cubes | Reviewers:
Authors: Janoš Vidali | Work issues:
Report Upstream: N/A | Commit:
Branch: | 5c2284f2a37cb7b89f9ccd9f0bce921b0933ef87
u/jaanos/add_is_partial_cube | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by jaanos):
Hi!
Replying to [comment:12 jmantysalo]:
> Propably a stupid question, as I know very little graph theory, but:
Isn't the definition "isometrically embedded into a hypercube" defined
also for non-connected graphs? I.e. it equals to definition by Hamming
distance only when the graph is connected.
It is, but clearly no disconnected graph G can be isometrically embeded
into a connected graph H, as two vertices in distinct connected components
of G will not be connected by any shortest path in H.
> And a kind of bikeshedding: A user writing `G.is_partial_cube?` will get
help that does not define partial cube but says what is the complexity and
who invented algorithm.
Yes, I should change that.
By the way, should I be worried about the failing plugin on the buildbot?
The log is not very helpful in telling me what exactly went wrong.
Janoš
--
Ticket URL: <http://trac.sagemath.org/ticket/19985#comment:13>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
