Semisymmetric graphs of order 6p 2 and prime valency

Han, Heyou; Lu, Zaiping

doi:10.1007/s11425-012-4424-9

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction5

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

2023

Publication Types

Select...

Article9

Relationship

Self Cite2

Independent7

Authors

Journals

Cited by 10 publications

(7 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Connected cubic semisymmetric graphs of orders 4p 3 , 6p 2 , 6p 3 , 8p 3 , 10p 3 , 18p n have been classified in [3,8,11,13] and [22].…”

Section: Introductionmentioning

confidence: 99%

Independence number and packing coloring of generalized Mycielski graphs

Bidine¹,

Gadi²,

Kchikech³

2021

Discuss. Math. Graph Theory

View full text Add to dashboard Cite

A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let p be an arbitrary prime. Folkman proved [Regular line-symmetric graphs, J. Combin. Theory 3 (1967) 215-232] that there is no semisymmetric graph of order 2p or 2p 2 . In this paper an extension of his result in the case of cubic graphs of order 20p 2 is given. We prove that there is no connected cubic semisymmetric graph of order 20p 2 or, equivalently, that every connected cubic edge-transitive graph of order 20p 2 is necessarily symmetric.

show abstract

“…Connected cubic semisymmetric graphs of orders 4p 3 , 6p 2 , 6p 3 , 8p 3 , 10p 3 , 18p n have been classified in [3,8,11,13] and [22].…”

Section: Introductionmentioning

confidence: 99%

Independence number and packing coloring of generalized Mycielski graphs

Bidine¹,

Gadi²,

Kchikech³

2021

Discuss. Math. Graph Theory

View full text Add to dashboard Cite

show abstract

“…Connected cubic semisymmetric graphs of orders 4p 3 , 6p 2 , 6p 3 , 8p 2 , 8p 3 , 10p 3 , and 18p n (n ≥ 1) were also classified in [1,2,8,11,13,21].…”

Section: Introductionmentioning

confidence: 99%

Classifying semisymmetric cubic graphs of order20p

Shahsavaran¹,

Darafsheh²

2019

Turk J Math

View full text Add to dashboard Cite

show abstract

“…The class of semisymmetric graphs was introduced by Folkman [7] who constructed several infinite families of such graphs and posed eight open problems which spurred the interest in this topic, see [5,6,10,12,[15][16][17][18] for example. This paper deals with semisymmetric cubic graphs of square-free order.…”

Section: Introductionmentioning

confidence: 99%