[PDF] Top 20 Cubic symmetric graphs of orders $36p$ and $36p^{2}$
Has 10000 "Cubic symmetric graphs of orders $36p$ and $36p^{2}$" found on our website. Below are the top 20 most common "Cubic symmetric graphs of orders $36p$ and $36p^{2}$".
Cubic symmetric graphs of orders $36p$ and $36p^{2}$
... 14. C. E. Praeger, R. J. Wang, and M. Y. Xu, Symmetrics graphs of order a product of two distinct primes, Journal of Combinatorial Theory, 58(2) (1993), 299-318. 15. D. J. Robinson, A Course On Group ... See full document
9
Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders
... the Rhombic Dodecahedron which is sometimes also called the Rhomboidal Dodecahedron, see 9. The Rhombic Dodecahedron appears in some applications in natural sciences, see, for example, 10, 11. It is the convex polyhedron ... See full document
11
Classification of the pentavalent symmetric graphs of order 18p
... various symmetric graphs with different orders have been studied ...classified cubic symmetric graphs of orders ...metric graphs of orders 2pq, 12p, 4pq, 30p ... See full document
13
On Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
... Let A ⊆ V (G). Then the induced subgraph of G with vertex set A is denoted by G[A]. Given a graph H , the graph G is called H-free, if it contains no induced subgraph isomorphic to H. A graph G has an H -decomposition, ... See full document
8
1A The binomial theorem 1B Polynomials 1C Division of polynomials 1D Linear graphs 1E Quadratic graphs 1F Cubic graphs 1G Quartic graphs
... g(x) (a straight line, passing through the origin and bisecting the first quadrant) and p(x) (a basic square root curve). Note that only the first quadrant is needed, since the domain is R + ∪ {0}. The first point of ... See full document
627
Characterising subclasses of perfect graphs with respect to partial orders related to edge contraction.
... Characterising graph classes by forbidding a set of graphs has been a common feature in graph theory for many years. Up to date many classes have been char- acterised with respect to the induced subgraph relation ... See full document
5
New Expansion for Certain Isomers of Various Classes of Fullerenes
... • The Stone-Wales rearrangement [18] is a transformation that constructs an isomer of a fullerene graph. This transformation rearranges the pentagons and hexagons in a patch with two pentagons and two hexagons without ... See full document
11
PP 2011 02: Normal Forms for Priority Graphs
... partial orders over properties of these objects, forming a richer medium for showing how these orderings ...priority graphs are expressed by simple propositional formulae and partial orders over ... See full document
9
Characterizing symmetric diametrical graphs of order 12 and diameter 4
... Diametrical graphs are an interesting class of ...these graphs, see Mulder [5, 6], Parthasarathy and Nandakumar [7], and Göbel and Veldman ...diametrical graphs have been classified and studied by ... See full document
5
Smallest cubic and quartic graphs with a given number of cutpoints and bridges
... SMALLEST CUBIC AND QUARTIC GRAPHS WITH A GIVEN NUMBER OF CUTPOINTS AND BRIDGES GARY CHARTRAND and FARROKH SABA Department of Mathematics, Western Michigan University Kalamazoo, Michigan [r] ... See full document
8
Volume 29: Graph Transformation and Visual Modeling Techniques 2010
... all graphs containing none of the forbidden subgraphs is an invariant for each ...all graphs that do contain one of the forbidden subgraphs, we perform a backwards analysis on each rewrite rule and check ... See full document
14
Automorphism Groups Of Weakly Semi-Regular Bipartite Graphs
... Proof : From the Theorem 2.4, we get that the graph G = 𝑆𝑀(Σ n ) is a 𝑊𝑆𝐵 𝐸𝑁𝐷 graph. So the automorphisms of G forms a group. When 𝑛 = 2, the 𝐴𝑢𝑡( 𝐺) is an abelian group. When 𝑛 > 2, the graph G has more ... See full document
5
The all or nothing flow problem in directed graphs with symmetric demand pairs
... node-capacitated graphs with slightly weaker parameters ...directed graphs, there is no simple clustering process akin to using a spanning tree (or even an ...edge-capacitated graphs [10] and with ... See full document
27
Scaling dimensions of higher charge monopoles at deconfined critical points
... It would also be of interest to obtain an estimate on simi- lar lines for the monopole with q = 4, which is of relevance for the JQ model on the square lattice. In this case, however, single-site defects, analogous to ... See full document
12
Generalized quark-antiquark potential at weak and strong coupling
... We have studied a family of Wilson loop operators which continuously interpolates between the 1/2 BPS line and the antiparallel lines. All these Wilson loops can be thought of as calculating a generalization of ... See full document
44
The all or nothing flow problem in directed graphs with symmetric demand pairs
... is symmetric. In the following, we only consider symmetric multicommodity flow ...a symmetric multicommodity flow instance, the maximum concurrent flow and the sparsest node ... See full document
27
Solution of Stochastic Cubic and Quintic Nonlinear Diffusion Equation Using WHEP, Pickard and HPM Methods
... with cubic and quintic nonlin- ear losses and stochastic non homogeneity are solved using different techniques, mainly the Pickard approxi- mation, the WHEP technique and ...the cubic and quintic nonlinear ... See full document
16
Metrics and isospectral partners for the most generic cubic PT-symmetric non-Hermitian Hamiltonian
... Non-Hermitian Hamiltonians are usually interpreted as effective Hamiltonians associated with dissipative systems when they possess a complex eigenvalue spectrum. However, from time to time also non-Hermitian Hamiltonians ... See full document
22
Hamilton Cycle Heuristics in Hard Graphs
... Intuitively, a Hamilton path is a path that visits every vertex of a graph exactly once. If there is an edge between the starting and ending point of a Hamilton path then the Hamilton path is a Hamilton cycle. Such ... See full document
109
Symmetric Product Graphs
... with which a topology can be constructed. (A similar topology can be constructed even if X is not a metric space, but this notion of distances is sufficient for this paper.) By observing graphs as the union of ... See full document
56
Related subjects