#13578: Generator for Ringed-Tree graphs
----------------------------+-----------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: minor | Milestone: sage-5.5
Component: graph theory | Keywords:
Work issues: | Report Upstream: N/A
Reviewers: | Authors: David Coudert
Merged in: | Dependencies: #13306
Stopgaps: |
----------------------------+-----------------------------------------------
A ringed tree of level `k` is a fully binary tree with k levels (counting
the root as a level) in which all vertices at the same level are connected
by a ring. Such graphs have been used for instance in
[http://arxiv.org/abs/1201.1717].
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13578>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
