𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two-arc closed subsets of graphs

✍ Scribed by Marston Conder; Margaret Morton; Cheryl E. Praeger


Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
136 KB
Volume
42
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A subset of vertices of a graph is said to be 2‐arc closed if it contains every vertex that is adjacent to at least two vertices in the subset. In this paper, 2‐arc closed subsets generated by pairs of vertices at distance at most 2 are studied. Several questions are posed about the structure of such subsets and the relationships between two such subsets, and examples are given from the class of partition graphs. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 42: 350–364, 2003


πŸ“œ SIMILAR VOLUMES


Two remarks on circular arc graphs
✍ Pavol Hell; Jing Huang πŸ“‚ Article πŸ“… 1997 πŸ› Springer Japan 🌐 English βš– 461 KB
Forcing closed unbounded subsets of Ο‰2
✍ M.C. Stanley πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 459 KB

It is shown that there is no satisfactory ΓΏrst-order characterization of those subsets of !2 that have closed unbounded subsets in !1; !2 and GCH preserving outer models. These "anticharacterization" results generalize to subsets of successors of uncountable regular cardinals. Similar results are pr

Finite symmetric graphs with two-arc tra
✍ Zaiping Lu; Sanming Zhou πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 299 KB

## Abstract Let $\Gamma$ be a finite __G__‐symmetric graph whose vertex set admits a nontrivial __G__‐invariant partition $\cal B$. It was observed that the quotient graph $\Gamma\_{\cal B}$ of $\Gamma$ relative to $\cal B$ can be (__G__, __2__)‐arc transitive even if $\Gamma$ itself is not necessa