Abstract
This chapter highlights the problems associated with the production of lists of graphs by computer. Graph theory has many roots and branches and as yet, no uniform and standard terminology has been agreed. However, workers in other fields are accustomed to different definitions and terminology. The problems related to graph-theoretical terms are a method for the representation of both simple graphs and multi-graphs in a computer, and the identification of a graph in a list of possibly thousands of graphs. In the representation of a graph in a computer if its points can be labeled with the integers 1,2,…,n, because the adjacency matrix of the graph can be used to represent it, there is no difficulty. When identifying a graph in a list of possibly some hundreds of graphs, the canonical matrix was first produced and only compared with those of all graphs in the list which had the same degree subsets (simple graphs), or the same degree and degree specification subsets (multigraphs).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
