The census of small connected cubic vertex-transitive graphs is a joint project by Primož Potočnik, Pablo Spiga, and Gabriel Verret, where they computer all cubic, vertex transitive graphs on n ...
School of Mathematics and Information Sciences, Guangxi University, Nanning, China. School of Mathematics and Statistics, Yunnan University, Kunming, China. 3) Let be a coset graph and G be a ...
A Halin graph on n vertices and m edges is a graph that is planar, 3-connected, and has a face whose number of vertices equals m-n+1. A cubic graph is a graph with every vertex of degree 3. This ...
Cubic graphs – those regular graphs in which every vertex has degree three – remain a fertile area of research in both combinatorics and theoretical computer science. These graphs are not only central ...
A function is a rule that is applied to one set of values to give another set of values. A function can be illustrated on a graph – points are plotted as coordinates and joined by either a straight ...
ABSTRACT: Let be a connected Cayley graph of group G, then Γ is called normal if the right regular representation of G is a normal subgroup of , the full automorphism group of Γ. For the case where G ...
Abstract: We solve an open question posed by Akers and Krishnamurthy in 1986 concerning VLSI layout of star graphs. We show that the area of the optimal layout of an N-node star graph, hierarchical ...
Abstract: This work examines the possibilities of increasing the efficiency of the computation of proper edge k-coloring of cubic graph with the use of machine learning methods. State-of-the-art ...
A quadratic graph is produced when you have an equation of the form \(y = ax^2 + bx + c\), where \(b\) and \(c\) can be zero but \(a\) cannot be zero. All quadratic graphs have a line of symmetry.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback