On P-transitive graphs and applications
We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show that the mu-calculus fixpoint hierarchy is infinite for P-tran...
Main Author: | Giacomo Lenzi |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2011-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1106.1243v1 |
Similar Items
-
On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components
by: Giovanna D'Agostino, et al.
Published: (2010-06-01) -
Tetravalent Arc-Transitive Graphs of Order 3p2
by: Ghasemi Mohsen
Published: (2014-08-01) -
P-graph Approach to Planning Human Resource Expansion for Universities in Transition
by: Kathleen B. Aviso, et al.
Published: (2018-08-01) -
Regularity and transitivity in graphs
by: Shawe-Taylor, John Stewart
Published: (1985) -
Network conduciveness with application to the graph-coloring and independent-set optimization transitions.
by: Valmir C Barbosa
Published: (2010-01-01)