One-regular cubic graphs of order a small number times a prime or a prime square

Yan, Feng; Kwak, Jin Ho

doi:10.1017/s1446788700009903

Cited by 39 publications

(29 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Not surprisingly arc-transitive graphs, and cubic arc-transitive graphs in particular, have received considerable attention over the years, the aim being to obtain structural results and possibly a classification of such graphs of different transitivity degrees, particular orders or satisfying additional properties (see, for example [27,30,31,44,45,46,47,60,70,106,107,108,109,110,130]). The frequently used methods in this respect are based on covering graph techniques while using a particular additional condition about their automorphism groups such as, for example, imprimitivity or existence of particular semiregular automorphisms (see Sections 2 and 4).…”

Section: Structural Propertiesmentioning

confidence: 99%

“…(For graph-covering terms not defined here we refer the reader to [55,102,105].) As shown by Djoković [35], symmetry properties of X are, to some extent, reflected by the symmetries of Y provided that enough automorphisms lift along p. The lifting problem is well understood, see [35,40,44,73,76,77,78]. Thus, studying symmetries of X arising via lifting automorphisms should be considered 'easy'.…”

Section: Imprimitivitymentioning

confidence: 99%

See 1 more Smart Citation

Recent trends and future directions in vertex-transitive graphs

Kutnar

Marušič

2008

Ars Math. Contemp.

View full text Add to dashboard Cite

A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex set. Some recent developments and possible future directions regarding two famous open problems, asking about existence of Hamilton paths and existence of semiregular automorphisms in vertex-transitive graphs, are discussed, together with some recent results on arc-transitive graphs and half-arc-transitive graphs, two special classes of vertex-transitive graphs that have received particular attention over the last decade.Keywords: Vertex-transitive graph, arc-transitive graph, half-arc-transitive graph, Hamilton cycle, Hamilton path, semiregular group, (im)primitive group.Math. Subj. Class.: 05C25, 20B25 1 In the beginning Vertex-transitive graphs, that is, graphs whose automorphisms groups acts transitively on the corresponding vertex sets, have been an active topic of research for a long time now. Much of this interest is due to their suitability to model scientific phenomena when symmetry is an issue. It is the aim of this article to discuss recent developments surrounding two well known open problems in vertex-transitive graphs -the Hamilton path/cycle problem and the semiregularity problem -as well as the general question addressing structural properties of arc-transitive and half-arc-transitive graphs. In doing so we will also try to contemplate possible directions this area of research is likely to take in the near future. * Supported by "Agencija za raziskovalno dejavnost Republike Slovenije", research program P1-0285.E-mail addresses: klavdija.kutnar@upr.si (Klavdija Kutnar), dragan.marusic@upr.si (Dragan Marušič) Copyright c 2008 DMFA -založništvo K. Kutnar, D. Marušič: Recent Trends and Future Directions in Vertex-Transitive Graphs 113The article is organized as follows. In Section 2 we discuss the problem, posed by the second author in 1981 (see [79]) who asked if it is true that a vertex-transitive digraph contains a nonidentity automorphism with all orbits of equal length, in short, a semiregular automorphism. Section 3 gives a quick overview of the problem, posed by Lovàsz in 1969 (see [72]), who asked if it is true that every connected vertex-transitive graph contains a Hamilton path, thus motivating a great deal of research into vertex-transitive graphs in the following decades. In Section 4, imprimitivity, one of the most fundamental concepts in the theory of permutation groups, is considered with special emphasis given to a recently developed theory which links the existence of blocks of imprimitivity in vertex-transitive graphs, having an abelian semiregular subgroup of automorphisms, to certain conditions that need to be satisfied in the corresponding quotient graph relative to the orbits of such a subgroup. Finally, in Section 5 we deal with some recent structural results on arc-transitive and half-arc-transitive graphs, as well as their link to some open problems in the theory of configurations.For group-theoretic terms not defined here we refer the reader to [124]. Semiregularit...

show abstract

Section: Structural Propertiesmentioning

confidence: 99%

Section: Imprimitivitymentioning

confidence: 99%

Recent trends and future directions in vertex-transitive graphs

Kutnar

Marušič

2008

Ars Math. Contemp.

View full text Add to dashboard Cite

show abstract

“…Throughout this paper, p and q are prime numbers. The s-regular cubic graphs of some orders such as 2p 2 , 4p 2 , 6p 2 , 10p 2 were classified in Feng [9,10,11,12]. Also, cubic s-regular graphs of order 2pq were classified in Zhou [27].…”

Section: Introductionmentioning

confidence: 99%

ON THE CUBIC EDGE-TRANSITIVE GRAPHS OF ORDER $58p2$

pourmokhtar

Alaeiyan

2015

JIMS

View full text Add to dashboard Cite

Abstract. A graph is called edge-transitive, if its full automorphism group acts transitively on its edge set. In this paper, we inquire the existence of connected edge-transitive cubic graphs of order 58p 2 for each prime p. It is shown that only for p = 29, there exists a unique edge-transitive cubic graph of order 58p 2 .Key words: Edge-transitive graphs, Symmetric graphs, Semisymmetric graphs, sRegular graphs, Regular coverings.Abstrak. Sebuah graf disebut transitif-sisi jika grup automorfisma penuhnya berlaku secara transitif pada himpunan sisinya. Pada paper ini, kami meneliti keberadaan graf kubik transitif-sisi terhubung berorde 58p 2 untuk setiap bilangan prima p. Kami tunjukkan bahwa hanya untuk p = 29 terdapat graf kubik transitif-sisi unik berorde 58p 2 .

show abstract

“…The first example of a cubic one-regular graph was constructed by Frucht [21]. Further research in cubic one-regular graphs has been part of a more general project dealing with the investigation of cubic arc-transitive graphs (see [9,15,[17][18][19][20]31]). Tetravalent one-regular graphs have also received considerable attention.…”

Section: Introductionmentioning

confidence: 99%