✦ LIBER ✦

Influence of the structure of a graph on its automorphisms

✍ Scribed by V. I. Trofimov

Publisher: Springer US
Year: 1988
Tongue: English
Weight: 706 KB
Volume: 27
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf01982312

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Automorphic Chromatic Index of a

On the Automorphic Chromatic Index of a Graph

✍ Carla Fiori; Giuseppe Mazzuoccolo; Beatrice Ruini 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 266 KB

The influence of graph structure on gene

The influence of graph structure on generalized dimension exchange

✍ B. Litow 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 640 KB

A note on bounded automorphisms of infin

A note on bounded automorphisms of infinite graphs

✍ Chris D. Godsil; Wilfried Imrich; Norbert Seifter; Mark E. Watkins; Wolfgang Woe 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 439 KB

On the Automorphism Groups of Quasiprimi

On the Automorphism Groups of Quasiprimitive Almost Simple Graphs

✍ Xin Gui Fang; George Havas; Cheryl E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 111 KB

Let be a graph and let G be a subgroup of automorphisms of . Then G is said to be locally primitive on if, for each vertex v, the stabilizer G v induces a primitive group of permutations on the set of vertices adjacent to v. This paper investigates pairs G for which G is locally primitive on , G is

On the number of automorphisms of struct

On the number of automorphisms of structures

✍ F. Galvin; G. Hesse; K. Steffens 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 335 KB

The strength of a graph and its applicat

The strength of a graph and its application to organizational structure

✍ Michael F. Capobianco; John C. Molluzzo 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 500 KB

The strength of a point in a graph is defined as the increase in the number of connected components in the graph upon removal of the point. Given an ordering of the points of a graph, the strength vector S of the graph is the vector whose ith component is the strength of the ith point of the graph.