Abstract
This paper analyzes some graph issues by using the symbolic program Mathematica and its version for the Web, webMathematica. In particular, we consider the problem of graph coloring: the assignment of colors to the vertices/edges of the graph such that adjacent vertices/edges are colored differently. In addition, we address the problem of obtaining the tenacity of binomial trees with Mathematica. Finally, we describe briefly an example of the application of our software to a scheduling problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.