scholarly journals Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs

2016 ◽  
Vol 627 ◽  
pp. 36-53 ◽  
Author(s):  
Rong-Xia Hao ◽  
Zeng-Xian Tian ◽  
Jun-Ming Xu
Keyword(s):  
Symmetric Graphs ◽  
Conditional Diagnosability

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

Classifying Heptavalent Symmetric Graphs of Order 40p

2020 ◽  
Vol 51 (4) ◽  
pp. 1893-1901
Author(s):  
Song-Tao Guo
Keyword(s):  
Symmetric Graphs

scholarly journals Symmetric graphs and interpretations

1984 ◽  
Vol 37 (3) ◽  
pp. 235-244 ◽  
Author(s):  
Emo Welzl
Keyword(s):  
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

Relating Diagnosability, Strong Diagnosability and Conditional Diagnosability of Strong Networks

2014 ◽  
Vol 63 (7) ◽  
pp. 1847-1851 ◽  
Author(s):  
Qiang Zhu ◽  
Guodong Guo ◽  
Dajin Wang
Keyword(s):  
Conditional Diagnosability

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.

g-good-neighbor conditional diagnosability of star graph networks under PMC model and MM* model

2017 ◽  
Vol 12 (5) ◽  
pp. 1221-1234 ◽  
Author(s):  
Shiying Wang ◽  
Zhenhua Wang ◽  
Mujiangshan Wang ◽  
Weiping Han
Keyword(s):  
Star Graph ◽  
Pmc Model ◽  
Conditional Diagnosability ◽  
Star Graph Networks ◽  
Good Neighbor
Sign in / Sign up

Export Citation Format

Share Document