Symmetric graphs of valency 4 having a quasi-semiregular automorphism

2021 ◽  
Vol 399 ◽  
pp. 126014
Author(s):  
Fu-Gang Yin ◽  
Yan-Quan Feng
Keyword(s):  
Symmetric Graphs ◽  
Semiregular Automorphism

Prime-valent symmetric graphs admitting alternating transitive group

2021 ◽  
Vol 407 ◽  
pp. 126334
Author(s):  
Jing Jian Li ◽  
Jing Yang ◽  
Ran Ju ◽  
Hongping Ma
Keyword(s):  
Transitive Group ◽  
Symmetric Graphs

A classification of cubic symmetric graphs of order 16p 2

2011 ◽  
Vol 121 (3) ◽  
pp. 249-257
Author(s):  
MEHDI ALAEIYAN ◽  
B N ONAGH ◽  
M K HOSSEINIPOOR
Keyword(s):  
Symmetric Graphs

Cyclic permutations and crossing numbers of join products of two symmetric graphs of order six

2019 ◽  
Vol 35 (2) ◽  
pp. 137-146
Author(s):  
STEFAN BEREZNY ◽  
MICHAL STAS ◽  
◽  
Keyword(s):  
Crossing Number ◽  
Crossing Numbers ◽  
Symmetric Graphs ◽  
Isolated Vertex ◽  
Join Of Graphs ◽  
Discrete Graph

The main purpose of this article is broaden known results concerning crossing numbers for join of graphs of order six. We give the crossing number of the join product G + Dn, where the graph G consists of one 5-cycle and of one isolated vertex, and Dn consists on n isolated vertices. The proof is done with the help of software that generates all cyclic permutations for a given number k, and creates a new graph COG for calculating the distances between all vertices of the graph. Finally, by adding some edges to the graph G, we are able to obtain the crossing numbers of the join product with the discrete graph Dn and with the path Pn on n vertices for other two graphs.

On the Modal μ-Calculus Over Finite Symmetric Graphs

2015 ◽  
Vol 65 (4) ◽  
Author(s):  
Giovanna D’Agostino ◽  
Giacomo Lenzi
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Satisfiability Problem ◽  
Finite Model ◽  
Model Property ◽  
Finite Model Property ◽  
Symmetric Graphs ◽  
Trivial Consequence

AbstractIn this paper we consider the alternation hierarchy of the modal μ-calculus over finite symmetric graphs and show that in this class the hierarchy is infinite. The μ-calculus over the symmetric class does not enjoy the finite model property, hence this result is not a trivial consequence of the strictness of the hierarchy over symmetric graphs. We also find a lower bound and an upper bound for the satisfiability problem of the μ-calculus over finite symmetric graphs.

Self-complementary symmetric graphs

1992 ◽  
Vol 16 (1) ◽  
pp. 1-5 ◽  
Author(s):  
Hong Zhang
Keyword(s):  
Symmetric Graphs
Sign in / Sign up

Export Citation Format

Share Document