𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On several symmetry conditions for graphs

✍ Scribed by Xingxing Yu

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
524 KB
Volume
102
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

On several symmetry conditions for graphs, Discrete Mathematics 102 (1992) 51-59.

In this paper we deal with simple graphs. We investigate vertex-transitivity, edge-transitivity and symmetry of graphs, especially the relationships among them. We first give an equivalent condition for a graph to be vertex-transitive.

Then we show that there is an infinite class of graphs whose edge-transitivity is equivalent to symmetry. Also we shall give a positive answer to a special case of a question by Holton.

πŸ“œ SIMILAR VOLUMES

One sufficient condition for hamiltonian
One sufficient condition for hamiltonian graphs
✍ Guantao Chen πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 220 KB πŸ‘ 1 views

## Abstract Let __G__ be a 2‐connected graph of order __n.__ We show that if for each pair of nonadjacent vertices __x__,__y__ ∈ __V(G)__, then __G__ is Hamiltonian.

On minimal imperfect graphs with circula
On minimal imperfect graphs with circular symmetry
✍ BacsοΏ½, GοΏ½bor; Boros, Endre; Gurvich, Vladimir; Maffray, FrοΏ½dοΏ½ric; Preissmann, My πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 293 KB

Results of LovΓ‘sz and Padberg entail that the class of so-called partitionable graphs contains all the potential counterexamples to Berge's famous Strong Perfect Graph Conjecture, which asserts that the only minimal imperfect graphs are the odd chordless cycles with at least five vertices (''odd hol

Remark on the graphs with a central symm
Remark on the graphs with a central symmetry
✍ Ferdinand Glivjak; Anton Kotzig; JΓ‘n Plesnik πŸ“‚ Article πŸ“… 1970 πŸ› Springer Vienna 🌐 English βš– 245 KB