A new 5‐arc‐transitive cubic graph
From MaRDI portal
Publication:5905318
DOI10.1002/jgt.3190060409zbMath0501.05039OpenAlexW2054628217MaRDI QIDQ5905318
Publication date: 1982
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190060409
Related Items
On extension of regular graphs, A channel assignment problem for optical networks modelled by Cayley graphs, Graphs determined by polynomial invariants, Sparse topologies with small spectrum size, Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs, Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\), Star partitions and regularity in graphs, Some problems on chromatic polynomials, A bibliography on chromatic polynomials, On top locally-\(s\)-distance-transitive graphs, On a canonical construction of tessellated surfaces from finite groups, Group actions, coverings and lifts of automorphisms, Finding regular subgraphs in both arbitrary and planar graphs, Symmetries in graphs via simplicial automorphisms, Arc-transitive trivalent Cayley graphs, Automorphisms of graphs and coverings, Intersection density of cubic symmetric graphs, On the critical group of the \(n\)-cube, Subspaces in \(d\)-bounded distance-regular graphs and their applications, On a class of finite symmetric graphs, The coefficients of Laplacian characteristic polynomials of graphs, On the girth of voltage graph lifts, Graphs, networks, and linear unbiased estimates, Spatial circulants, with applications, Enumeration of spanning trees of graphs with rotational symmetry, Linear criteria for lifting automorphisms of elementary abelian regular coverings, Which graphs are determined by their spectrum?, The chromatic uniqueness of certain complete \(t\)-partite graphs., Tutte polynomials and related asymptotic limiting functions for recursive families of graphs, On the non-existence of antipodal cages of even girth, Distance-transitive graphs of valency 5, 6 and 7, A probabilistic result for the max-cut problem on random graphs, Chromatic polynomials for lattice strips with cyclic boundary conditions, Structural properties of Potts model partition functions and chromatic polynomials for lattice strips, Exact Potts model partition functions on strips of the honeycomb lattice, The combinatorics of overlapping genes, The number of spanning forests of a graph, Ground state entropy of the Potts antiferromagnet on triangular lattice strips., Finite symmetric graphs with two-arc transitive quotients, Zeros of Jones polynomials for families of knots and links, Potts model partition functions for self-dual families of strip graphs, Krein conditions and near polygons, Root systems and the Johnson and Hamming graphs, Divisors and the spectrum of infinite graphs, Graphs related to Held's simple group, Antipodal covering graphs, Imprimitive distance-regular graphs and projective planes, Exact Potts model partition function on strips of the triangular lattice, \(T=0\) partition functions for Potts antiferromagnets on lattice strips with fully periodic boundary conditions, Tutte uniqueness of line graphs, Discrete Green's functions, Approximations for chromatic polynomials, General structural results for Potts model partition functions on lattice strips, Lifting graph automorphisms by voltage assignments, Cayley maps, Nonexistence of some antipodal distance-regular graphs of diameter four, A matrix method for chromatic polynomials, Integral circulant Ramanujan graphs via multiplicativity and ultrafriable integers, Ground state entropy of the Potts antiferromagnet on strips of the square lattice, Constructing a class of symmetric graphs, Coverings that preserve sense of direction, The critical group of a threshold graph, The geometric girth of a distance-regular graph having certain thin irreducible modules for the Terwilliger algebra, A survey of some problems in combinatorial designs - a matrix approach, A new feasibility condition for distance-regular graphs, Regular codes in regular graphs are difficult, On symmetries of Cayley graphs and the graphs underlying regular maps, The matching polynomial of a regular graph, On the number of 3-edge colorings of cubic graphs, Root system graphs, Resistance distances and Kirchhoff index of graphs with an involution, Orbit polynomial graphs of prime order, On 2-transitive graphs of girth 5, Weighted complexities of graph products and bundles, Synchronization processes in complex networks, Möbius regular maps, Walk generating functions and spectral measures of infinite graphs, Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II, The large cliques in the graph of quadratic forms, On distance-regular graphs with fixed valency. III, Spectral radius of finite and infinite planar graphs and of graphs of bounded genus, Hardness results and spectral techniques for combinatorial problems on circulant graphs, The energy and spanning trees of the Aztec diamonds, A trivalent graph with 58 vertices and girth 9, More odd graph theory, On the spectral characterization of some unicyclic graphs, A construction of imprimitive symmetric graphs which are not multicovers of their quotients, Girth, valency, and excess, On the orientably-regular embeddings of graphs of order prime-cube, Eigenvalues of graphs with vertices of large degree at distance three apart, Spectra of uniform hypergraphs, Graph spectra in computer science, The asymptotic behavior of some indices of iterated line graphs of regular graphs, Remarks on distance-regular graphs, How many P-polynomial structures can an association scheme have?, On vertex symmetric digraphs, On the orientable regular embeddings of complete multipartite graphs, On the number of Latin rectangles and chromatic polynomial of L(K//(r,s)), Characterization of H(n,q) by the parameters, Regular graphs with excess one, Extremal energies of integral circulant graphs via multiplicativity, On sharply edge-transitive permutation groups, Combinatorially homogeneous graphs, Laplacian spectral characterization of some graph products, On the non-existence of perfect and nearly perfect codes, The expected hitting times for finite Markov chains, Strongly regular graphs and finite Ramsey theory, Hamiltonian paths in vertex-symmetric graphs of order 5p, Bipartite distance-regular graphs of valency three, Regular embeddings of Cartesian product graphs, New graphs related to \((p,6)\) and \((p,8)\)-cages, The symbiotic relationship of combinatorics and matrix theory, On the number of spanning trees and Eulerian tours in iterated line digraphs, A domain monotonicity theorem for graphs and Hamiltonicity, Generalized Cayley graphs, Lattices generated by join of strongly closed subgraphs in \(d\)-bounded distance-regular graphs, Almost rank three graphs, Umbral interpolation and the addition/contraction tree for graphs, Second neighbourhoods of strongly regular graphs, Nonexistence of certain cubic graphs with small diameters, Spectra, Euclidean representations and clusterings of hypergraphs, Laplace eigenvalues of graphs---a survey, Completely regular codes, Complete catalogue of graphs of maximum degree 3 and defect at most 4, On minimum rank and zero forcing sets of a graph, Exact chromatic polynomials for toroidal chains of complete graphs, A little statistical mechanics for the graph theorist, A note on universally optimal matrices and field independence of the minimum rank of a graph, Which wheel graphs are determined by their Laplacian spectra?, Homogeneous graphs, An improved version of Lloyd's theorem, Spectrally degenerate graphs: hereditary case, Nearly perfect codes in distance-regular graphs, Critical groups for homeomorphism classes of graphs, A refined classification of symmetric cubic graphs, q-coverings, codes and line graphs, Net structure and cages, Distributed consensus in noncooperative inventory games, Two-colorable graph states with maximal Schmidt measure, A short proof of a theorem of Bannai and Ito, Enumerating spanning trees of graphs with an involution, Counting trees in directed regular multigraphs, The infinitude of 7-arc-transitive graphs, Classification of a family of symmetric graphs with complete 2-arc-transitive quotients, Cubic \(s\)-arc transitive Cayley graphs, Permanent of the Laplacian matrix of trees and bipartite graphs, Exceptional presentations of three generalized hexagons of order 2, Chromatic polynomials of homeomorphism classes of graphs, Spanning trees in regular graphs, Subdivisions and chromatic roots, Association schemes of quadratic forms, On generalized hexagons and a near octagon whose lines have three points, Some properties of a multidigraph by semi-incidence matrices, On the polynomial of a path, Infinite coverings of cages, On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group \(M_{12}\)), 1-homogeneous graphs, The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\), Spectra and optimal partitions of weighted graphs, Vertex-primitive digraphs of prime-power order are hamiltonian, Random walks on the triangular prism and other vertex-transitive graphs, Integral circulant graphs
Cites Work
