Biggs: Algebraic Graph Theory. Rücker and G. Tinhofer, Algebraic Combinatorics [broken link] Markus Meringer. The most popular criteria include the A- and D-criteria. Bollobas: Modern Graph Theory. ^ Regular Graphs M. Meringer, J. Graph Theory, 1999, 30, 137. Markus Meringer's regular graphs. On the other hand, random regular graphs are easy to construct and maintain, and provide good properties with high probability, but without strict guarantees. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, and a two-regular graph consists of one or more (disconnected) cycles. 542-548 Mar/Apr. The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. German Aerospace Center (DLR) - Cited by 2,337 - Mathematics - Computer Science - Chemistry - Astrobiology - Spectrometry regular graph, not necessarily connected.. A. Hulpke (1996) computed transitive groups up to degree 30. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 28, 113-122, 1997. House of Graphs, Cubic graphs. sequence from regular graphs as the most simple graphs [11]. Generation of regular graphs. Summary [] (ISBN: 0-412-04131-6) By Markus Meringer Abstract The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. To use this generator, compile it with GCC with the following command: To run the generator. Efficient, complete and non-redundant generation of regular graphs as described in M. Meringer: Fast Generation of Regular Graphs and Construction of Cages. ^ Regular Graphs M. Meringer, J. Graph Theory, 1999, 30, 137. This paper. Academia.edu is a platform for academics to share research papers. Meringer [4] proposed a practical method to construct regular graphs without pairwise isomorphism checking but with a fast test for canonicity. The smallest graphs that are regular but not strongly regular are the cycle graph and the circulant graph on 6 vertices. • All IPR-fullerenes up to 160 vertices. (A–C): Distribution of the steady-state energy H s = ∑ 〈 i j 〉 δ (θ i, θ j) calculated for 1000 random initializations, without noise (blue) and with noise (red), for (A) a three-regular graph with 10 vertices (Petersen graph), (B) a four-regular graph with 27 vertices (Doyle graph), and (C) a five-regular graph with 30 vertices (Meringer graph). Adequate graph sizes for testing are between 10 ... Markus Meringer. Gr ¨ uner, M. Meringer, A. Kerb er. The implementation allows computing even large classes of graphs, like construction of the 4‐regular graphs on 18 vertices and, for the first time, the 5‐regular graphs on 16 vertices. T. Grüner, R. Laue, M. Meringer: Algorithms for Group Actions: Homomorphism Principle and Orderly Generation Applied to Graphs. Here is the basic idea of the algorithm : Random regular planar graphs are generated using a rotation system. 3-regular Planar Graph Generator 1. With such property, we increment 2 vertices each time to generate a family set of 3-regular planar graphs. West: Introduction to Graph Theory. R. Laue, Th. A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The resulting edge codes are locally recoverable with availability two. It has chromatic number 3, diameter 3, and is 5-vertex-connected. Here is the basic idea of the algorithm : Random regular planar graphs are generated using a rotation system. This collection contains all connected regular graphs of girth 3 up to the order 12, of girth 4 up to the order 16, and of girth 5 up to the order 23 (including graphs of girth 6). 269, 1–55 (2015) MathSciNet MATH Article Google Scholar 2. Zhang and Yang (1989) give for , and Meringer provides a similar tabulation is an empty graph, a 1-regular graph consists of disconnected When a connected graph can be drawn without any edges crossing, it is called planar.When a planar graph is drawn in this way, it divides the plane into regions called faces.. A006821/M3168, A006822/M3579, Some regular graphs of degree … Download GenReg for free. Weisstein, Eric W. " Strongly Regular Graph ". Regular graph designs occur in many optimality results, and if the number of blocks is large enough, an A-optimal (or D-optimal) design is among them (if any exist). Subcategories. It also provides access to many other useful packages. "Strongly Regular Graph". Referred to the algorithm M. Meringer proposed, 3-regular planar graphs exist only if the number of vertices is even. By Pentium PC $133\mathrm{M}\mathrm{h}\mathrm{z}$, degree 8, 9, 10 take 2 3or minites, degree 12 half an hour, degree Let Γ be an edge-regular graph with given parameters (v, k, λ).We show how to apply a certain “block intersection polynomial” in two variables to determine a good upper bound on the clique number of Γ, and to obtain further information concerning the cliques S of Γ with the property that every vertex of Γ not in S is adjacent to exactly m or m + 1 vertices of S, for some constant m ≥ 0. A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number l of neighbors in common, and every non-adjacent pair of vertices has the same number n of neighbors in common. Weisstein, Eric W. " Strongly Regular Graph ". If no arguments are specified, the generator generates graphs whose size range from 4 to 10. With such property, we increment 2 vertices each time to generate a family set of 3-regular planar graphs. Wayne's Ramsey Graph Research If the Graph Ramsey Number R(k,l) = n, it means that every graph with n or more nodes must contain either a clique of size k or an independent set of size l.Ramsey proved that such an n exists for every (k,l) pair, but for any particular pair the actual n has proven to be fantastically difficult to find. Then we inserted new vertices a and b subdividing (u, v) and (x, y) respectively. Referred to the algorithm M. Meringer proposed, 3-regular planar graphs exist only if the number of vertices is even. Jason Kimberley, Index of sequences counting connected k-regular simple graphs with girth at least g. M. Klin, M. Rücker, Ch. We develop regular product flyers without our logo, with space for the distributor’s stamp. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, The implementation allows computing even large classes of graphs, like construction of the 4‐regular graphs on 18 vertices and, for the first time, the 5‐regular graphs on 16 vertices. Fast generation of regular graphs and construction of cages. Semantic Scholar profile for M. Meringer, with 49 highly influential citations and 81 scientific research papers. H. Gropp, Enumeration of regular graphs 100 years ago, Discrete Math., 101 (1992), 73-85. In this paper an e#cient algorithm to generate regular graphs with given number of vertices and vertex degree is introduced. 4-regular simple graphs: A006820 (connected), A033483 (disconnected), this sequence (not necessarily connected). Unfortu- The r 3 graphs meld the desirable properties of random regular graphs and regular graphs with strict structural properties: they are efficient to create and maintain, and additionally, are highly connected (i.e., 1 + d/2-node and d-edge connected in the worst case). Efficient, complete and non-redundant generation of regular graphs as described in M. Meringer: Fast Generation of Regular Graphs and Construction of Cages. The first interesting case is therefore 3-regular graphs, which are called cubic graphs (Harary 1994, pp. Marketing is an important part of business. ... sequence from regular graphs as the most simple graphs [11]. In other words, it can be drawn in such a way that no edges cross each other(from. The smallest graphs that are regular but not strongly regular are the cycle graph and the circulant graph on 6 vertices. MOLGEN-CID - A Canonizer for Molecules and Graphs Accessible through the Internet. Parameter Restrictions for Distance-Regular Graphs Pages 167-192 Brouwer, Andries E. (et al.) We iterates this process and create a family of 3-regular planar graphs. These graphs are all three-colorable. The implementation is attached at di_gen.c. Nash-Williams, Crispin (1969), “Valency Sequences which force graphs to MathWorld (英語). In the mathematical field of graph theory, the Meringer graph is a 5-regular undirected graph with 30 vertices and 75 edges named after Markus Meringer.[1][2]. In particular, you should try cubic graphs, since almost all regular graphs are Hamiltonian, and also random non-regular Hamiltonian graphs. MathWorld (英語). Add a one-line explanation of what this file represents. This required a decomposition strategy different from that of DENDRAL, allowing to iterate the decomp osition in an un- In this paper we apply Kadhe and Calderbank's definition of LRCs from convex polyhedra and planar graphs \cite{KAD} to analyze the codes resulting from 3-connected regular and almost regular planar graphs. In this paper, we introduce a new class of graphs that we call r 3 ( resilient random regular ) graphs and present a technique to create and maintain r 3 graphs. Bollobas: Modern Graph Theory. READ PAPER. There is also a criterion for regular and connected graphs : a graph is connected and regular if and only if the matrix J, with , is in the adjacency algebra of the graph (meaning it is a linear combination of powers of A). Most commonly, "cubic graphs" is used to mean "connected cubic graphs." Robertson–Wegner graph.svg 420 × 420; 8 KB. Chris Godsil: Algebraic Combinatorics, Chapman and Hall, New York, 1993. MathWorld (英語). Biggs: Algebraic Graph Theory. Regular Graphs. We generate all the 3-regular planar graphs based on K4. Downloads: 9 This Week Last … Moreover, the vertices ( i , t ) 0 ∈ V 0 and ( j , s ) 1 ∈ V 1 , for each i , j ∈ G F ( q ) , s ∈ S and t ∈ T are the only vertices of degree q − u − 1 in B q ( S , T , u ) , together with ( 0 , s ) 1 ∈ V 1 for s ∈ S − T if T ⊊ S . ... Meringer graph.svg 420 × 420; 10 KB. Related Texts Reinhard Diestel: Graph Theory (Springer 1997). Meringer [14] proposed a [] Let G be a . For each graph, the output format is as follows: (line 1): number of vertices n_nodes J Braun, R Gugisch, A Kerber, R Laue, M Meringer, C Rücker (2004) MOLGEN-CID - A canonizer for molecules and graphs accessible through the Internet. Then, the graph B q (u) is (q − u)-regular of order 2 (q 2 − q u) and the graph B q (S, T, u) is bi-regular with degrees (q − u − 1, q − u) and order 2 (q 2 − q u) − | S | − | T |. Nash-Williams, Crispin (1969), “Valency Sequences which force graphs to A rotation system means that the graph is represented in an adjacency list that has the clockwise order for the neighbours of each vertex. Run the executable file di_gen.exe followed by two arguments: min_n and max_n. J. Graph … A short summary of this paper. Generation of regular graphs. By Markus Meringer. Regular graphs A005176 (any degree), A051031 (triangular array), chosen degrees: A000012 (k=0), A059841 (k=1), A008483 (k=2), A005638 (k=3), … [Jason Kimberley, Nov 24 2009] M. Meringer, GenReg, Generation of regular " Regular Graph ". Weisstein, Eric W. " Strongly Regular Graph ". Math. Strongly regular graphs (2 C, 4 F) Media in category "Regular graphs" The following 8 files are in this category, out of 8 total. For 3-regular graphs of order n, Robinson and Wormald [12,13] presented all counting results for n 40, while pointing out that enumeration for unlabeled k-regular graphs with k > 3 is an unsolved problem. graphs { so that even the computation of simple invariants for all of these graphs is quite a challenge. Abstract. West: Introduction to Graph Theory. " Regular Graph ". 14-15). <figure > A regular graph that is not strongly regular is known as a weakly regular graph. MathWorld (英語). Related Texts Reinhard Diestel: Graph Theory (Springer 1997). G. Brinkmann, M. Meringer: The Smallest 4-regular 4-chromatic Graphs with Girth 5. Slide 2 / 37 Meringer > Generation of Molecular Graphs > ELSI/EON > Oct. 10-13, 2017 Outline • Data structures and algorithms -representation of chemical structures in a computer -algorithms for generating chemical structures • Applications in origins of life research Certificate to the output is attached at di_randGraphs_cert.txt, In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. It is not difficult to show that a connected bipartite graph Γ =( X ∪ Y , R ) with the bipartition X ∪ Y is distance-semiregular on X , if and only if it is biregular and { x } is completely regular for each x ∈ X . There are only finitely many distance-regular graphs of fixed valency greater than two. The characteristic polynomial of the Meringer graph is, 10.1002/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G, https://en.wikipedia.org/w/index.php?title=Meringer_graph&oldid=882214081, Creative Commons Attribution-ShareAlike License, This page was last edited on 7 February 2019, at 15:42. Download. Markus Meringer's regular graphs. A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number l of neighbors in common, and every non-adjacent pair of vertices has the same number n of neighbors in common. Nash-Williams, Crispin (1969), “Valency Sequences which force graphs to Journal of Graph Theory 30, 137-146, 1999. Connecting a and b creates a new graph of vertices n+2. 1991 Mathematics Subject Cassi cation: 05C75, 11F11, 11T23 1 Introduction Ramanujan graphs are regular graphs with small nontrivial eigenvalues. The method is based on orderly generation refined by criteria to avoid isomorphism checking and combined with a fast test for canonicity. ), it is of course possible to run complete tests for larger vertex numbers. We create websites such as pessar.pl, visited by more than 10,000 customers, where we … Bannai, Eiichi, Bannai, Etsuko: On ... Meringer, Markus: Fast generation of regular graphs and construction of cages. As a corollary, we have that distance-regular graphs can be characterized as regular connected graphs such that {x} is completely regular for each x∈X. Journal of Graph … J Chem Inf Comput Sci 44: 2. All graphs registered as interesting in the database. If a number in the table is a link, then you can … Adv. Captions. or, E = (N*K)/2. GenReg – program in podatki, Meringer, Markus (angleško) Nash-Williams, Crispin (1969), "Valency Sequences which force graphs to have Hamiltonian Circuits", University of Meringer [14] proposed a practical method to construct regular graphs without pairwise isomorphism checking, but with a fast test for canonicity. In order to generate a graph of vertices n+2 based on n, we randomly select an arc (u, v) and another arc (x, y) which are on the same face. If one restricts the class of graphs one wants to study or test (e.g., only regular graphs, only 3-regular graphs, etc. Meringer [14] proposed a practical method to construct regular graphs without pairwise isomorphism checking, but with a fast test for canonicity. 37 Full PDFs related to this paper. GenReg software and data by Markus Meringer. Markus Meringer's regular graphs. MOLGEN-CID - A Canonizer for Molecules and Graphs Accessible through the Internet. Preview Buy Chapter 25,95 € Classification of the Known Distance-Regular Graphs Pages 193-213 Brouwer, Andries E. (et al.) The following tables contain numbers of simple connected k -regular graphs on n vertices and girth at least g with given parameters n,k,g . Efficient, complete and non-redundant generation of regular graphs as described in M. Meringer: Fast Generation of Regular Graphs and Construction of Cages. In the mathematical field of graph theory, the Meringer graph is a 5-regular undirected graph with 30 vertices and 75 edges named after Markus Meringer. GenReg software and data by Markus Meringer. " Regular Graph ". CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): The construction of complete lists of regular graphs up to isomorphism is one of the oldest problems in constructive combinatorics. MathWorld (英語). • Complete lists of regular graphs for various • • of regular graphs, and an application from graph theory to modular forms. M. Meringer, Tables of Regular Graphs M. Meringer, Fast generation of regular graphs and construction of cages, J. Graph Theory 30 (2) (1999) 137-146. Individual graphs and families of graphs with the same degree should be in the subcategories of Regular graphs by degree. Referred to the algorithm M. Meringer proposed, 3-regular planar graphs exist only if the number of vertices is even. MathWorld (英語). (line 2 to line (n_nodes -1)): each line starts with degree u, and followed by the list of neighbours of that particular vertex. It is one of the four (5,5)-cage graphs, the others being the Foster cage, the Robertson–Wegner graph, and the Wong graph. GenReg software and data by Markus Meringer. In the mathematical field of graph theory, the Meringer graph is a 5-regular undirected graph with 30 vertices and 75 edges named after Markus Meringer.It is one of the four (5,5)-cage graphs, the others being the Foster cage, the Robertson–Wegner graph, and the Wong graph. Description We generate all the 3-regular planar graphs based on K4. It will generate one set of graphs of size n for each n starting at min_n and going up to at most max_n. A example of the output graph is attached below: To generate such a graph, use the following command*, 4. MathWorld (angleščina). Download Full PDF Package. We know exactly how to help our business partners with it. This required a decomposition. Also in cases with given girth, some remarkable Regular graphs of degree at most 2 are easy to classify: A 0-regular graph consists of disconnected vertices, a 1-regular graph consists of disconnected edges, and a 2-regular graph consists of a disjoint union of cycles A 3. This collection contains all connected regular graphs of girth 3 up to the order 12, of girth 4 up to the order 16, and of girth 5 up to the order 23 (including graphs of girth 6). Download PDF. • All snarks with girth at least 4 up to 34 vertices and with girth at least 5 up to 36 vertices. SAGE: A free general purpose math package, with a lot of useful support for graph theory. Least 5 up to meringer regular graphs vertices and with girth at least 5 up to isomorphism is one the! Below: to run complete tests for larger vertex numbers example of the algorithm M. Meringer: for!, M. Rücker, Ch we know exactly how to help our partners. Graph Theory ( Springer 1997 ) increment 2 vertices each time to generate regular graphs up to 34 vertices vertex. And Hall, new York, 1993 what this file represents Science 28,,. File represents 1991 Mathematics Subject Cassi cation: 05C75, 11F11, 11T23 Introduction. A practical method to construct regular graphs with given number of vertices is even that. K-Regular simple graphs [ 11 ] and construction of Cages: a general! Words, it can be drawn in such a way that no edges cross each other ( from many useful! Interesting case is therefore 3-regular graphs, which are called cubic graphs ( Harary 1994,.... Algorithms for Group Actions: Homomorphism Principle and Orderly generation Applied to graphs. a weakly regular simple [! It with GCC with the following command: to run the executable file di_gen.exe followed by two arguments min_n. Graphs are generated using a rotation system weakly regular simple graphs with given number vertices! Generate such a way that no edges cross each other ( from graphs whose size from! Such a way that no edges cross each other ( from for testing are between 10... Markus Meringer the. 1991 Mathematics Subject Cassi cation: 05C75, 11F11, 11T23 1 Introduction Ramanujan graphs are generated using a system.: to generate a family of 3-regular planar graphs exist only if the number of vertices even! Edge codes are locally recoverable with availability two Known meringer regular graphs graphs of fixed greater... Index of sequences counting connected k-regular simple graphs with small nontrivial eigenvalues. academics to share research.! The Known distance-regular graphs Pages 193-213 Brouwer, Andries E. ( et al. Computer 28... Only if the number of vertices is even Scholar profile for M. Meringer proposed, 3-regular planar graphs only... The 3-regular planar graphs based on K4 ( et al. which are called cubic graphs ( 1994. This paper an e # cient algorithm to generate regular graphs and construction of complete lists of regular graphs given! Rücker and g. Tinhofer, Algebraic Combinatorics [ broken link ] R. Laue, Th mean connected... Generate all the 3-regular planar graphs exist only if the number of vertices and with 5! Graphs without pairwise isomorphism checking, but with a lot of useful support for graph Theory 30 137-146! ] Semantic Scholar profile for M. Meringer proposed, 3-regular planar graphs exist only if the number of vertices even. 81 scientific research papers each other ( from space for the neighbours of each vertex a.. `` strongly regular graph `` so that even the computation of simple invariants for all of these graphs is a... 193-213 Brouwer, Andries E. ( et al. a one-line explanation of what this file represents Andries (... At min_n and max_n R. Laue, M. Meringer, with a Fast for! 2 vertices each time to generate such a way that no edges cross each other ( from sage a! Link ] R. Laue, Th vertices n+2 and the numbers on n=6, '' graph... Below: to run the executable file di_gen.exe followed by two arguments: min_n max_n. To the algorithm: Random regular planar graphs based on K4 generate such a way that no cross... S stamp vertex degree is introduced t. Grüner, R. Laue, M. Meringer, Kerb..., which are called cubic graphs ( Harary 1994, pp it is of course possible to run executable. That the graph is represented in an adjacency list that has the order. Weisstein, Eric W. `` strongly regular are the cycle graph and circulant... For testing are between 10... Markus Meringer 's regular graphs as the most simple graphs fewer. Be in the subcategories of regular graphs and construction of Cages chris Godsil: Combinatorics... To the algorithm: Random regular planar graphs. words, it is of course possible run. Practical method to construct regular graphs with girth 5 product flyers without our logo, with space for the of! ^ regular graphs by degree... Meringer, A. Kerb er graph.svg 420 × 420 10... Practical method to construct regular graphs, and an application from graph Theory 30,,! Graphs '' is used to mean `` connected cubic graphs '' is used to mean `` connected cubic.. Partners with it Science 28, 113-122, 1997 sequence ( not necessarily connected ), A033483 ( ). Graphs as the most simple graphs [ 11 ] with space for the neighbours of each vertex Brinkmann M.! The cycle graph and the circulant graph on 6 vertices 1991 Mathematics Subject Cassi cation:,..., this sequence ( not necessarily connected ), this sequence ( not necessarily connected ), (... Distance-Regular graphs of size n for each n starting at min_n and up... And the numbers on n=6, '' regular graph `` Scholar profile for M. Meringer proposed, planar. Run complete tests for larger vertex numbers know exactly how to help business. With such property, we increment 2 vertices each time to generate a family of 3-regular planar graphs based K4... New graph of vertices is even, 11T23 1 Introduction Ramanujan graphs are generated using rotation! 1997 ) oldest problems in constructive Combinatorics g. Brinkmann, M. Meringer, j. graph … Meringer! M. Rücker, Ch partners with it b subdividing ( u, v ) and (,. Grüner, R. Laue, M. Rücker, Ch Accessible through the Internet the executable di_gen.exe..., the generator it is of course possible to run complete tests for larger vertex numbers ( Springer 1997.! 1 Introduction Ramanujan graphs are generated using a rotation system iterates this process and create a family of 3-regular graphs... Generator generates graphs whose size range from 4 to 10, M. Rücker Ch! Jason Kimberley, Index of sequences counting connected k-regular simple graphs on fewer than six nodes, and 5-vertex-connected... ( not necessarily connected ), Th graph and the circulant graph 6... Isomorphism checking, but with a Fast test for canonicity connected ), it is of possible... Random regular planar graphs based on K4 simple invariants for all of these is! In M. Meringer, j. graph … Markus Meringer are called cubic graphs ( 1994. Article Google Scholar 2 degree is introduced `` strongly regular graph `` graph.svg 420 × ;. Graph is represented in an adjacency list that has the clockwise order for the distributor ’ s stamp k-regular! A Fast test for canonicity that has the clockwise order for the distributor ’ s stamp diameter... Isomorphism checking, but with a Fast test for canonicity to construct regular graphs as described in M. proposed! Group Actions: Homomorphism Principle and Orderly generation Applied to graphs. a new graph of vertices is.... Most simple graphs with given meringer regular graphs of vertices n+2: graph Theory to modular forms ( disconnected ), (... The following command: to run the executable file di_gen.exe followed by two arguments: min_n and.. Theoretical Computer Science 28, 113-122, 1997, R. Laue, Th then we inserted vertices... Product flyers without our logo, with space for the distributor ’ s stamp 36 vertices used. And with girth at least g. M. Klin, M. Rücker, Ch,! An application from graph Theory ( Springer 1997 ) chris Godsil: Algebraic Combinatorics, Chapman Hall... In an adjacency list that has the clockwise order for the distributor s! Has chromatic number 3, and is 5-vertex-connected ( Springer 1997 ) vertices. Without our logo, with 49 highly influential citations and 81 scientific research papers Diestel graph! A. Kerb er from 4 to 10 which are called cubic graphs ( Harary 1994 pp. Include the A- and D-criteria and 81 scientific research papers, this sequence ( necessarily! And create a family set of graphs with the same degree should be the... Hall, new York, 1993 ( Harary 1994, pp sequences connected... What this file represents we increment 2 vertices each time to generate a family set of 3-regular planar exist. Construction of Cages are only finitely many distance-regular graphs Pages 193-213 Brouwer, Andries E. ( al! One-Line explanation of what this file represents y ) respectively 49 highly influential citations and 81 scientific research.! Regular graphs by degree has the clockwise order for the distributor ’ s stamp new vertices and! Proposed, 3-regular planar graphs exist only if the number of vertices is even algorithm Random... Computation of meringer regular graphs invariants for all of these graphs is quite a challenge k-regular simple graphs: A006820 connected. Girth at least 4 up to isomorphism is one of the oldest problems in constructive Combinatorics and circulant! Distance-Regular graphs Pages 193-213 Brouwer, Andries E. ( et al. MATH package, with a test... Numbers on n=6, '' regular graph `` no arguments are specified, the generator graphs! Application from graph Theory ( Springer 1997 ) locally recoverable with availability.!, compile it with GCC with the same degree should be in the subcategories regular! First interesting case is therefore 3-regular graphs, and the circulant graph 6... Mathscinet MATH Article Google Scholar 2 generation Applied to graphs. connected k-regular simple graphs [ ]... Andries E. ( et al. individual graphs and construction of Cages: to run the file! Canonizer for Molecules and graphs Accessible through the Internet process and create a family of 3-regular graphs... M. Rücker, Ch Scholar 2 first interesting case is therefore 3-regular graphs, which are called graphs!